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 count = 0;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		}

		System.out.println(count);

	}
} 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 count = 0;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					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;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					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;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					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 int seisuu = 0; seisuu 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		} int i = 0; int i = 0; i 0 i < n -1 i n -1 n 1 i++ i++ i {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		} {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		} for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			} int j = i + 1; int j = i + 1; j i + 1 i 1 j < n j n j++ j++ j {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			} {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			} double dist = 0.0; dist 0.0 for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				} int k = 0; int k = 0; k 0 k < d k d k++ k++ k {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				} {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				} double diff = (x[i][k] - x[j][k]); diff (x[i][k] - x[j][k]) x[i][k] x[i] x i k x[j][k] x[j] x j k dist += Math.pow(diff, 2) dist Math.pow(diff, 2) Math.pow Math diff 2 dist = Math.sqrt(dist) dist Math.sqrt(dist) Math.sqrt Math dist seisuu = (int)dist seisuu (int)dist if ((double)seisuu == dist) {
					count++;

				} (double)seisuu == dist (double)seisuu dist {
					count++;

				} count++ count System.out.println(count) System.out.println System.out System System.out count 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 count = 0;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		}

		System.out.println(count);

	}
} 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 count = 0;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		}

		System.out.println(count);

	}
} 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 count = 0;

		int seisuu = 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 -1; i++) {
			for (int j = i + 1; j < n; j++) {
				double dist = 0.0;
				for (int k = 0; k < d; k++) {
					double diff = (x[i][k] - x[j][k]);
					dist += Math.pow(diff, 2);
//					System.out.println(dist);
				}
				dist = Math.sqrt(dist);
//				System.out.println(dist);
				seisuu = (int)dist;
				if ((double)seisuu == dist) {
					count++;

				}
			}
		}

		System.out.println(count);

	}
}
