import java.util.Scanner;

/**
 * Main
 */
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;

        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 distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            }
        }
        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;

        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 distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    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];
        
        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-1; i++){
            for(int j = i+1; j < N; j++){
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    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];
        
        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-1; i++){
            for(int j = i+1; j < N; j++){
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    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 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-1; i++){
            for(int j = i+1; j < N; j++){
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    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 distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            }
        } {
            for(int j = i+1; j < N; j++){
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            }
        } for(int j = i+1; j < N; j++){
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            } int j = i+1; int j = i+1; j i+1 i 1 j < N j N j++ j++ j {
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            } {
                double distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            } double distance = 0; distance 0 int diff = 0; diff 0 for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                } int k = 0; int k = 0; k 0 k<D k D k++ k++ k {
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                } {
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                } 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 distance += diff*diff distance diff*diff diff diff if(Math.sqrt(distance) % 1==0){
                    count += 1;
                } Math.sqrt(distance) % 1==0 Math.sqrt(distance) % 1 Math.sqrt(distance) Math.sqrt Math distance 1 0 {
                    count += 1;
                } count += 1 count 1 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;

        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 distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            }
        }
        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;

        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 distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            }
        }
        System.out.println(count);
    }
} Main
import java.util.Scanner;

/**
 * Main
 */
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;

        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 distance = 0;
                int diff = 0;
                for(int k = 0; k<D; k++){
                    diff = X[i][k]-X[j][k];
                    distance += diff*diff;
                }
                if(Math.sqrt(distance) % 1==0){
                    count += 1;
                }
            }
        }
        System.out.println(count);
    }
}