import java.util.Scanner;

public class Main {
	static int r = 0;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int D = sc.nextInt();
		int[][] X = new int[N][D];
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < D; j++) {
				X[i][j] = sc.nextInt();
			}	
		}
		sc.close();
		for(int i = 0; i < N; i++) {
			for(int j = i + 1; j < N; j++) {
				solve(D, X, i, j);
			}
		}
		System.out.println(r);
	}
	
	static void solve(int D, int[][] X, int idx1, int idx2) {
		int sum = 0;
		for(int i = 0; i < D; i++) {
			int yx = Math.abs(X[idx1][i] - X[idx2][i]);
			sum += yx * yx;
		}
		double sqrt1 = Math.sqrt(sum);
		int sqrt2 = (int)sqrt1;
		if(sqrt1 == (double)sqrt2) r++;
		// System.out.println("# " + (sqrt1 == (double)sqrt2) + " = " + sum + " : " + sqrt1 + " " + sqrt2);
	}
}	

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz