output_description: Print the minimum possible area of a rectangle that satisfies the condition.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K  
      x_1 y_1
      :  
      x_{N} y_{N}
attempt: n,k = map(int,input().split())
  xyl = []
  for _ in range(n):
      x,y = map(int,input().split())
      xyl.append((x,y))
  
  ans = float("inf")
  for i in range(n):
      for j in range(i+1, n):
          for h in range(j+1, n):
              for g in range(h+1, n):
                  x1 = min(xyl[i][0], xyl[j][0], xyl[h][0], xyl[g][0])
                  x2 = max(xyl[i][0], xyl[j][0], xyl[h][0], xyl[g][0])
                  y1 = min(xyl[i][1], xyl[j][1], xyl[h][1], xyl[g][1])
                  y2 = max(xyl[i][1], xyl[j][1], xyl[h][1], xyl[g][1])
                  cnt = 0
                  for p in range(n):
                      if x1 <= xyl[p][0] <= x2 and  y1 <= xyl[p][1] <= y2:
                          cnt += 1
                  if k <= cnt:
                      ans = min(ans, (x2-x1)*(y2-y1))
  
  for i in range(n):
      for j in range(i+1, n):
          for h in range(j+1, n):
              x1 = min(xyl[i][0], xyl[j][0], xyl[h][0])
              x2 = max(xyl[i][0], xyl[j][0], xyl[h][0])
              y1 = min(xyl[i][1], xyl[j][1], xyl[h][1])
              y2 = max(xyl[i][1], xyl[j][1], xyl[h][1])
                  cnt = 0
                  for p in range(n):
                      if x1 <= xyl[p][0] <= x2 and  y1 <= xyl[p][1] <= y2:
                          cnt += 1
                  if k <= cnt:
                      ans = min(ans, (x2-x1)*(y2-y1))
  
  for i in range(n):
      for j in range(i+1, n):
          x1 = min(xyl[i][0], xyl[j][0])
          x2 = max(xyl[i][0], xyl[j][0])
          y1 = min(xyl[i][1], xyl[j][1])
          y2 = max(xyl[i][1], xyl[j][1])
              cnt = 0
              for p in range(n):
                  if x1 <= xyl[p][0] <= x2 and  y1 <= xyl[p][1] <= y2:
                      cnt += 1
              if k <= cnt:
                  ans = min(ans, (x2-x1)*(y2-y1))
  
  
  
  print(ans)
problem_description: Statement
  
  We have N points in a two-dimensional plane.  
  The coordinates of the i-th point (1 \leq i \leq N) are (x_i,y_i).  
  Let us consider a rectangle whose sides are parallel to the coordinate axes
  that contains K or more of the N points in its interior.  
  Here, points on the sides of the rectangle are considered to be in the
  interior.  
  Find the minimum possible area of such a rectangle.
samples: [{"input": "4 4\n    1 4\n    3 3\n    6 2\n    8 1", "output": "21\n    \n\nOne rectangle that satisfies the condition with the minimum possible area has\nthe following vertices: (1,1), (8,1), (1,4) and (8,4).  \nIts area is (8-1) \u00d7 (4-1) = 21.\n\n* * *"}, {"input": "4 2\n    0 0\n    1 1\n    2 2\n    3 3", "output": "1\n    \n\n* * *"}, {"input": "4 3\n    -1000000000 -1000000000\n    1000000000 1000000000\n    -999999999 999999999\n    999999999 -999999999", "output": "3999999996000000001\n    \n\nWatch out for integer overflows."}]