import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        @SuppressWarnings("resource")
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int d = sc.nextInt();
        int[][] x = new int[n][d];
        for (int i = 0 ; i < n ; i++) {
            for (int j = 0 ; j < d ; j++) {
                x[i][j] = sc.nextInt();
            }
        }
        int count = 0;
        for (int i = 0 ; i < n ; i++) {
            for (int j = i + 1 ; j < n ; j++) {
                int dis = 0;
                for (int k = 0 ; k < d ; k++) {
                    dis += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);
                }
                for (int k = 1 ; k <= 200 ; k++) {
                    if (dis == k * k) 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