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

class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int d = sc.nextInt();
		
		int[][] list = new int[n][d];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < d; j++) {
				list[i][j] = sc.nextInt();
			}
		}
		
//		int cnt = 0;
//		for (int i = 0; i < n - 1; i++) {
//			int sum = 0;
//			for (int j = 0; j < d; j++) {
//				int temp = (int) Math.pow(list[i][j] - list[i + 1][j], 2);
//				sum += temp;
//			}
//			int temp2 = (int) Math.sqrt(sum);
//			if (Math.pow(temp2, 2) == sum) {
//				cnt++;
//			}
//			
//		}
		
		// n3 d4
		int cnt = 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++) {
					int temp = (int) Math.pow(list[i][k] - list[j][k], 2);
					sum += temp;
				}
				int temp2 = (int) Math.sqrt(sum);
				if (Math.pow(temp2, 2) == sum) cnt++;
			}
		}
		
		System.out.println(cnt);
				
	}
}
/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