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(), i, j;
		int[][] p = new int[n][d];
		for (i = 0; i < n; i++) {
			for (j = 0; j < d; j++) {
				p[i][j] = sc.nextInt();
			}
		}
		int count = 0;
		for (i = 0; i < n - 1; i++) {
			for (j = i + 1; j < n; j++) {
				int sum = 0;
				for (int k = 0; k < d; k++) {
					sum += (p[i][k] - p[j][k]) * (p[i][k] - p[j][k]);
				}
				double sqrt = Math.sqrt(sum);
				if (0 == sqrt % 1) {
					count++;
				}
			}
		}
		System.out.println(count);
	}
}

/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