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[][] pointInfo = new int[n][d];
		for(int i =0;i <n;i++) {
			for(int j =0;j <d;j++) {
				pointInfo[i][j] = sc.nextInt();
			}
		}
		int answer =0;
		for(int i = 0; i < n-1;i++) {
			for(int j = i +1; j < n;j++) {
				int kyori = 0;
				for(int k =0;k <d;k++) {
					kyori += (pointInfo[j][k]- pointInfo[i][k]) * (pointInfo[j][k]- pointInfo[i][k]);
				}
				int l =1;
				while(l <=16000) {
					if(l * l == kyori) {
						answer++;
						break;
					}
					l++;
				}
			}
		}
		System.out.println(answer);
	}
}
/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