import java.util.Scanner;

public class Main {

    private static final int MOD = 1_000_000_007;

    private static int[][] X;
    private static int D;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        D = sc.nextInt();

        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 cnt = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                if (i == j) break;

                if (distance(i, j)) cnt++;
            }
//            System.out.println();
        }

        System.out.println(cnt);
    }

    private static boolean distance(int i, int j) {
        double sum = 0;

        for (int k = 0; k < D; k++) {
            long x = X[i][k] - X[j][k];
            sum += x * x;
        }

        double s = Math.sqrt(sum);

        return s == Math.floor(s);
    }
}

/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