import java.util.Scanner;

class Main {

	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();
			}
		}
		int ans = 0;
		for(int outi=0; outi<N; outi++){
			for(int ini=outi+1; ini<N; ini++){
				int dist = 0;
				for(int j=0; j<D; j++){
					dist += Math.pow(x[outi][j] - x[ini][j], 2);
				}
				if(Math.sqrt(dist) == (int)Math.sqrt(dist))ans++;
			}
		}


		System.out.println(ans);
	}
}

/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