import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N=sc.nextInt(),D=sc.nextInt();
		int[][] map = new int[N][D];
		int ans=0;

		for(int i=0;i<N;i++) {
			for(int j=0;j<D;j++) {
				map[i][j]=sc.nextInt();
			}
		}

		for(int i=0;i<N;i++) {
			for(int j=i+1;j<N;j++) {
				double d=0;
				for(int k=0;k<D;k++) {
					d+=(map[i][k]-map[j][k])*(map[i][k]-map[j][k]);
				}
				d=Math.sqrt(d);
				if(d==Math.floor(d)) {
					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