import java.util.*;

public 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];
		int count=0;
		int sum=0;
				
		for(int i=0;i<N;i++) {
			for(int j=0;j<D;j++) {
				X[i][j]=sc.nextInt();
			}
		}
		
		for(int i=0;i<N-1;i++) {
			for(int j=i+1;j<N;j++) {
				for(int k=0;k<D;k++) {
					//System.out.println(Math.pow(Math.abs(X[i][k]-X[j][k]), 2));
					sum+=Math.pow(Math.abs(X[i][k]-X[j][k]), 2);
				}
				if(Math.sqrt(sum)==(int)Math.sqrt(sum)) {
					count++;
				}
				sum=0;
			}
		}
		System.out.print(count);
		sc.close();
	}
}

/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