import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) B solver = new B(); solver new B() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        }

    } B public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        } solve {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        } int n = Integer.parseInt(in.next()); n Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int d = Integer.parseInt(in.next()); d Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in 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] = Integer.parseInt(in.next());
                }
            } 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] = Integer.parseInt(in.next());
                }
            } {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            } for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                } int j = 0; int j = 0; j 0 j < d j d j++ j++ j {
                    x[i][j] = Integer.parseInt(in.next());
                } {
                    x[i][j] = Integer.parseInt(in.next());
                } x[i][j] = Integer.parseInt(in.next()) x[i][j] x[i] x i j Integer.parseInt(in.next()) Integer.parseInt Integer in.next() in.next in int ans = 0; ans 0 int s = 0; s 0 for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            } {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            } for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                } int j = i + 1; int j = i + 1; j i + 1 i 1 j < n j n j++ j++ j {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                } {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                } for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    } int k = 0; int k = 0; k 0 k < d k d k++ k++ k {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    } {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    } s += Math.pow(x[i][k] - x[j][k], 2) s Math.pow(x[i][k] - x[j][k], 2) Math.pow Math x[i][k] - x[j][k] x[i][k] x[i] x i k x[j][k] x[j] x j k 2 int a = (int) Math.sqrt(s); a (int) Math.sqrt(s) Math.sqrt Math s if (s == a * a) ans++; s == a * a s a * a a a ans++ ans s = 0 s 0 out.println(ans) out.println out ans int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            // 入力
            int n = Integer.parseInt(in.next());
            int d = Integer.parseInt(in.next());
            int x[][] = new int[n][d];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < d; j++) {
                    x[i][j] = Integer.parseInt(in.next());
                }
            }
            int ans = 0;
            int s = 0;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    for (int k = 0; k < d; k++) {
                        s += Math.pow(x[i][k] - x[j][k], 2);
                    }
                    int a = (int) Math.sqrt(s);
                    if (s == a * a) ans++;
                    s = 0;
                }
            }

            // 出力
            out.println(ans);

        }

    }
}

