import java.util.Scanner;

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

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];
		for(int i = 0; i < n; i++){
			for(int j = 0; j < d; j++){
				x[i][j] = sc.nextInt();
			}
		}
		
		int count = 0;
		for(int i = 0; i < n-1; i++){
			for(int j = i+1; j < n; j++){
				double a = 0;
				for(int k = 0; k < d; k++){
					a += Math.pow((double)(x[i][k] - x[j][k]),2);
				}
				for(int k = 0; k <= (int)a; k++){
					if(Math.pow((double)k,2.0) == a){
						count += 1;
					}
				}
			}
		}
		
		System.out.println(count);
	}
}