import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int d = sc.nextInt();
        int[][] x = new int[n][d];
        int ans = 0;

        for (int i = 0; i < n; i++)
            for (int j = 0; j < d; j++)
                x[i][j] = sc.nextInt();
            
        for (int i = 0; i < n; i++) {
            for (int j = i+1; j < n; j++) {
                int distance = 0;
                for (int k = 0; k < d; k++) {
                    distance += Math.pow(x[j][k]-x[i][k], 2);
                }
                if (Math.sqrt(distance) - (int)Math.sqrt(distance) == 0)
                    ans ++;
            }
        }
        System.out.println(ans);
    }
}

/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