import java.util.Scanner;

public class Main {
	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt(); //2個
		int d = scan.nextInt(); //3次元

		int[][] index = new int[n][d];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < d; j++) {
				index[i][j] = scan.nextInt();
			}
		}
		
		int count = 0;
		for (int i = 0; i < n; i++) {
			for (int j = i + 1; j < n; j++) {
				
				int sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow((index[i][k] - index[j][k]), 2);
				}
				
				int root = (int) Math.sqrt(sum);
				
				if (root * root == sum) 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