import java.util.Scanner;

class Main{
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int num[][];
		int N = sc.nextInt();
		int D = sc.nextInt();
		num = new int[N][D];
		for(int i = 0;i < N;i++) {
			for(int j = 0;j < D;j++) {
				num[i][j] = sc.nextInt();
			}
		}
		int count = 0;
		for(int i = 0;i < N - 1;i++) {
			for(int j = i + 1;j < N;j++) {
				double distance = 0;
				for(int k = 0 ; k < D ;k++) {
					distance += (num[i][k] - num[j][k]) * (num[i][k] - num[j][k]);
				}
				distance = Math.sqrt(distance);
				if(distance == (double)((int)(distance))) count++;
			}
		}
		System.out.println(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