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[][] x = new int[N][D];
    for (int i = 0; i < N; i++) for (int j = 0; j < D; j++) x[i][j] = scanner.nextInt();

    int count = 0;
    for (int i = 0; i < N - 1; i++) {
      for (int j = i + 1; j < N; j++) {
        long d = 0;
        for (int k = 0; k < D; k++) {
          d += (x[i][k] - x[j][k]) * (x[i][k] - x[j][k]);
        }
        int dd = (int) Math.sqrt(d);
        if (dd * dd == d) 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