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];
        for(int i = 0; i < n; i++){
            for(int j = 0; j < d; j++){
                X[i][j] = sc.nextInt();
            }
        }
        int[] dist = new int[n*(n-1)/2];
        int distsum = 0;
        int count = 0;
        int p = 0;
        for(int i = 0; i < n; i++){
            for(int j = i+1; j < n; j++){
                for(int k = 0; k < d; k++){
                    distsum = distsum + (X[i][k] - X[j][k]) * (X[i][k] - X[j][k]);
                }
                for(int l = 1; l <= distsum; l++){
                    if(distsum == l*l){
                        count++;
                    }
                }
                distsum = 0;
            }
        }
        System.out.print(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