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 = list(map(int, input().split()))
  xy = [tuple(map(int, input().split())) for i in range(n)]
  
  import heapq
  
  
  class Rect:
      def __init__(self, xy):
          self.xy = set(xy)
  
      def excluded(self, p):
          return Rect((q for q in self.xy if q != p))
  
      def __lt__(self, other):
          return self.get_score() < other.get_score()
  
      def __len__(self):
          return len(self.xy)
  
      def get_x_max(self):
          return max(self.xy, key=lambda t: t[0])
  
      def get_x_min(self):
          return min(self.xy, key=lambda t: t[0])
  
      def get_y_max(self):
          return max(self.xy, key=lambda t: t[1])
  
      def get_y_min(self):
          return min(self.xy, key=lambda t: t[1])
  
      def get_score(self):
          return (self.get_x_max()[0] - self.get_x_min()[0]) * (
              self.get_y_max()[1] - self.get_y_min()[1]
          )
  
      def __str__(self):
          return str(self.xy)
  
  
  heap = []
  r = Rect(xy)
  score = r.get_score()
  
  while len(r) > k:
      s = r.excluded(r.get_x_max())
      t = r.excluded(r.get_x_min())
      u = r.excluded(r.get_y_max())
      v = r.excluded(r.get_y_min())
      heapq.heappush(heap, s)
      heapq.heappush(heap, t)
      heapq.heappush(heap, u)
      heapq.heappush(heap, v)
      r = heapq.heappop(heap)
  
  print(r.get_score())
  
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."}]