import java.util.Scanner;
import java.util.stream.Stream;

class Main {
  private static void solve(int n, int d, int[][] x) {
    int count = 0;
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        long distance = 0;
        for (int k = 0; k < d; k++) {
          int diff = Math.abs(x[i][k] - x[j][k]);
          distance += diff * diff;
        }
        double sqrt = Math.sqrt((double) distance);
        if (Math.floor(sqrt) == sqrt) count++;
      }
    }
    System.out.println(count);
  }
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String[] num = sc.nextLine().split(" ");
    int n = Integer.parseInt(num[0]);
    int d = Integer.parseInt(num[1]);
    int[][] x = new int[n][d];
    for (int i = 0; i < n; i++) {
      String[] xi = sc.nextLine().split(" ");
      for (int j = 0; j < d; j++) x[i][j] = Integer.parseInt(xi[j]);
    }
    solve(n, d, x);
  }
}
/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