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: nums = input().split()
  n = int(nums[0])
  k = int(nums[1])
  points = []
  
  for i in range(n):
      temp = input().split()
      points.append([int(temp[0]), int(temp[1])])
  
  rmax = points[0][0]
  lmax = points[0][0]
  tmax = points[0][1]
  bmax = points[0][1]
  rmaxp = 0
  lmaxp = 0
  tmaxp = 0
  bmaxp = 0
  for i in range(1, n):
      if points[i][0] > rmax:
          rmax = points[i][0]
          rmaxp = i
      if points[i][0] < lmax:
          lmax = points[i][0]
          lmaxp = i
      if points[i][1] > tmax:
          tmax = points[i][0]
          tmaxp = i
      if points[i][1] < bmax:
          bmax = points[i][0]
          bmaxp = i
  
  min = (points[rmaxp][0] - points[lmaxp][0]) * (points[tmaxp][1] - points[bmaxp][1])
  patterns = []
  for i in range(n - k):
      for j in range(n - k - i):
          for k in range(n - k - i - j):
              patterns.append([i, j, k, k - n - i - j - k])
  for pattern in patterns:
      copypoints = points
      for i in range(pattern[0]):
          del copypoints[rmaxp]
      for i in range(pattern[1]):
          del copypoints[lmaxp]
      for i in range(pattern[2]):
          del copypoints[tmaxp]
      for i in range(pattern[3]):
          del copypoints[bmaxp]
      ans = (points[rmaxp][0] - points[lmaxp][0]) * (points[tmaxp][1] - points[bmaxp][1])
      if ans < min:
          min = ans
  
  print("{0}".format(min))
  
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."}]