import java.util.Scanner;

public 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 ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	}
} import java.util.Scanner; Scanner java.util public 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 ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	}
} 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 ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	} main {
		Scanner sc = new Scanner((System.in));
		int n = sc.nextInt();
		int d = sc.nextInt();
		int[][] x = new int[n][d];
		int ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	} 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 ans = 0 ans 0 sum = 0; sum 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			for (int j = i + 1; j < n; j++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		} {
			for (int j = i + 1; j < n; j++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		} for (int j = i + 1; j < n; j++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			} int j = i + 1; int j = i + 1; j i + 1 i 1 j < n j n j++ j++ j {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			} {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			} if (i == j) {
					continue;
				} i == j i j {
					continue;
				} continue; sum = 0 sum 0 for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				} int k = 0; int k = 0; k 0 k < d k d k++ k++ k {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				} {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				} sum += Math.pow(x[i][k] - x[j][k], 2) sum Math.pow(x[i][k] - x[j][k], 2) Math.pow Math x[i][k] - x[j][k] x[i][k] x[i] x i k x[j][k] x[j] x j k 2 if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				} Math.sqrt(sum) == (int)Math.sqrt(sum) Math.sqrt(sum) Math.sqrt Math sum (int)Math.sqrt(sum) Math.sqrt Math sum {
					ans++;
				} ans++ ans System.out.println(ans) System.out.println System.out System System.out ans sc.close() sc.close sc String[] args args public 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 ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	}
} public 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 ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	}
} Main
import java.util.Scanner;

public 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 ans = 0, sum = 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++) {
				if (i == j) {
					continue;
				}
				sum = 0;
				for (int k = 0; k < d; k++) {
					sum += Math.pow(x[i][k] - x[j][k], 2);
				}
				// System.out.println("i:"+i+" j:"+j+" sum:"+Math.sqrt(sum));
				if (Math.sqrt(sum) == (int)Math.sqrt(sum)) {
					ans++;
				}
			}
		}

		System.out.println(ans);

		sc.close();
	}
}
