import java.util.Scanner;

public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int D = scanner.nextInt();
        int[][] xArr = new int[N][D];
        for (int i = 0; i < N; i++) {
            for (int k = 0; k < D; k++) {
                xArr[i][k] = scanner.nextInt();
            }
        }

        int count = 0;
        for (int h = 0; h < N; h++) {
            for (int i = h+1; i < N; i++) {
                double distance = 0;
                for (int k = 0; k < D; k++) {
                    distance += Math.pow(Math.abs(xArr[h][k] - xArr[i][k]), 2);
                }
                double result = Math.sqrt(distance);
                if (result == (int)result) 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