output_description: Print the number of pairs (i, j) (i < j) such that the distance between the
  i-th point and the j-th point is an integer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N D
      X_{11} X_{12} ... X_{1D}
      X_{21} X_{22} ... X_{2D}
      \vdots
      X_{N1} X_{N2} ... X_{ND}
attempt: #
  # abc133 b
  #
  import sys
  from io import StringIO
  import unittest
  from math import sqrt
  
  
  class TestClass(unittest.TestCase):
      def assertIO(self, input, output):
          stdout, stdin = sys.stdout, sys.stdin
          sys.stdout, sys.stdin = StringIO(), StringIO(input)
          resolve()
          sys.stdout.seek(0)
          out = sys.stdout.read()[:-1]
          sys.stdout, sys.stdin = stdout, stdin
          self.assertEqual(out, output)
  
      def test_入力例_1(self):
          input = """3 2
  1 2
  5 5
  -2 8"""
          output = """1"""
          self.assertIO(input, output)
  
      def test_入力例_2(self):
          input = """3 4
  -3 7 8 2
  -12 1 10 2
  -2 8 9 3"""
          output = """2"""
          self.assertIO(input, output)
  
      def test_入力例_3(self):
          input = """5 1
  1
  2
  3
  4
  5"""
          output = """10"""
          self.assertIO(input, output)
  
  
  def resolve():
      N, D = map(int, input().split())
      X = [list(map(int, input().split())) for _ in range(N)]
  
      ans = 0
      for i, x1 in enumerate(X):
          for x2 in X[i + 1 :]:
              tmp = 0
              for j in range(D):
                  tmp += (x2[j] - x1[j]) ** 2
              tmp = sqrt(tmp)
              if tmp.is_integer() == True:
                  ans += 1
  
      print(ans)
  
  
  if __name__ == "__main__":
      # unittest.main()
      resolve()
  
problem_description: Statement
  
  There are N points in a D-dimensional space.
  
  The coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).
  
  The distance between two points with coordinates (y_1, y_2, ..., y_D) and
  (z_1, z_2, ..., z_D) is \sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D -
  z_D)^2}.
  
  How many pairs (i, j) (i < j) are there such that the distance between the
  i-th point and the j-th point is an integer?
samples: [{"input": "3 2\n    1 2\n    5 5\n    -2 8", "output": "1\n    \n\nThe number of pairs with an integer distance is one, as follows:\n\n  * The distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n  * The distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n  * The distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\n* * *"}, {"input": "3 4\n    -3 7 8 2\n    -12 1 10 2\n    -2 8 9 3", "output": "2\n    \n\n* * *"}, {"input": "5 1\n    1\n    2\n    3\n    4\n    5", "output": "10"}]