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