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 ans =0;
		for (int i = 0; i < N; i++) {
			for (int j = i+1; j < N; j++) {

				int dis =0;

				for (int k = 0; k < D; k++) {
					dis += (int) Math.pow(x[i][k]-x[j][k], 2);
				}
				for (int k = 0; k < 200; k++) {
					if (dis < Math.pow(k, 2)) {
						break;
					}
					if (dis == Math.pow(k, 2)) {
						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