import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try (Scanner s = new Scanner(System.in)) {
			final int N = s.nextInt();
			final int D = s.nextInt();
			final int X[][] = new int[N][D];
			for (int i = 0; i < N; i++) {
				for (int j = 0; j < D; j++) {
					X[i][j] = s.nextInt();
				}
			}

			int ret = 0;
			for (int i = 0; i < N; i++) {
				for (int j = i + 1; j < N; j++) {
					if (calc(X[i], X[j])) {
						ret++;
					}
				}
			}
			System.out.println(ret);
		}
	}

	static boolean calc(int[] x1, int[] x2) {
		int sum = 0;
		for (int i = 0; i < x1.length; i++) {
			sum += (x2[i] - x1[i]) * (x2[i] - x1[i]);
		}

		return Math.sqrt(sum) == (int) Math.sqrt(sum);
	}
}

/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