import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int D = Integer.parseInt(sc.next());
		int[][] arrayTwoDimension = new int[N][D];
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < D; j++) {
				arrayTwoDimension[i][j] = sc.nextInt();
			}
		}
		sc.close();
		int count = 0;
		for(int i = 0; i < N; i++) {
			
			for(int j = i + 1; j < N; j++) {
				double squareValue = 0;
				for(int k = 0; k < D; k++) {
					double value = Math.abs(arrayTwoDimension[i][k] - arrayTwoDimension[j][k]);
					double square = value * value;
					squareValue = squareValue + square;
				}
				double judge = Math.sqrt(squareValue);
				if(judge == Math.floor(judge)) {
					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