import java.util.Scanner;
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];
		
		for(int i=0;i<n;i++) {
			for(int j=0;j<d;j++) {
				x[i][j]=sc.nextInt();
			}
		}
		
		int ichiji = 0;
		int count = 0;
		
		for(int i=0;i<n;i++) {
			for(int j=i+1;j<n;j++) {
				ichiji = 0;
				for(int k=0;k<d;k++) {
					ichiji+=(x[i][k]-x[j][k])*(x[i][k]-x[j][k]);
				}
				if(isheiho(ichiji))
					count++;
			}
		}
		
		System.out.print(count);
		
	}
	
	public static boolean isheiho(int k) {
		int i=0;
		while(i*i<=k) {
			if(i*i==k)
				return true;
			else
				i++;
		}
		return false;
	}

}
/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