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