import 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];

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

} import java.util.*; util.* java 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];

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

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

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

} Main
import 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];

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

}