import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);
		final int N = scan.nextInt();
		final int D = scan.nextInt();
		int[][] point = new int[N][D];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < D; j++) {
				point[i][j] = scan.nextInt();
			}
		}
		scan.close();

		List<Integer> list = new ArrayList<>();
		for (int i = 0; i <= 130; i++) {
			list.add(i * i);
		}

		int count = 0;

		for (int i = 0; i < N; i++) {
			for (int j = i + 1; j < N; j++) {
				int distance = 0;
				for (int d = 0; d < D; d++) {
					distance += (point[i][d] - point[j][d]) * (point[i][d] - point[j][d]);
				}
				if (list.contains(distance)) {
					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