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[][] x = new int[n][d];
    int count = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    }
    System.out.println(count);
  }
} import java.util.*; util.* java 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];
    int count = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    }
    System.out.println(count);
  }
} 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];
    int count = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    }
    System.out.println(count);
  } main {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int d = sc.nextInt();
    int[][] x = new int[n][d];
    int count = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    }
    System.out.println(count);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int d = sc.nextInt(); d sc.nextInt() sc.nextInt sc int[][] x = new int[n][d]; x new int[n][d] n d int count = 0; count 0 for (int i = 0; i < n; i++) {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    } {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    } for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
        x[i][j] = sc.nextInt();
      } {
        x[i][j] = sc.nextInt();
      } x[i][j] = sc.nextInt() x[i][j] x[i] x i j sc.nextInt() sc.nextInt sc for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    } {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    } for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      } int j = i + 1; int j = i + 1; j i + 1 i 1 j < n j n j++ j++ j {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      } {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      } int num = 0; num 0 for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        } int k = 0; int k = 0; k 0 k < d k d k++ k++ k {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        } {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        } num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2) num Math.pow(Math.abs(x[i][k] - x[j][k]), 2) Math.pow Math Math.abs(x[i][k] - x[j][k]) Math.abs Math x[i][k] - x[j][k] x[i][k] x[i] x i k x[j][k] x[j] x j k 2 for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        } int k = 0; int k = 0; k 0 k <= num k num k++ k++ k {
          if (k * k == num) {
            count++;
          }
        } {
          if (k * k == num) {
            count++;
          }
        } if (k * k == num) {
            count++;
          } k * k == num k * k k k num {
            count++;
          } count++ count System.out.println(count) System.out.println System.out System System.out count String[] args args
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[][] x = new int[n][d];
    int count = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < d; j++) {
        x[i][j] = sc.nextInt();
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        int num = 0;
        for (int k = 0; k < d; k++) {
          num += Math.pow(Math.abs(x[i][k] - x[j][k]), 2);
        }
        for (int k = 0; k <= num; k++) {
          if (k * k == num) {
            count++;
          }
        }
      }
    }
    System.out.println(count);
  }
}