import java.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int D = sc.nextInt();
    int[][] points = new int[N][D];
    for (int i = 0; i < N; i++) for (int j = 0; j < D; j++) points[i][j] = sc.nextInt();
    int ans = 0;
    for (int i = 0; i < N; i++) {
      for (int j = i+1; j < N; j++) {
        double d = getDistance(points[i], points[j]);
        if (d == Math.ceil(d)) ans++;
      }
    }
    System.out.println(ans);
  }
  static double getDistance(int[] p1, int[] p2) {
    double ret = 0;
    for (int i = 0; i < p1.length; i++) {
      ret += Math.pow(p1[i]-p2[i],2);
    }
    return Math.sqrt(ret);
  }
}
/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