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: /usr/bin/python
  # -*- coding: utf-8 -*-
  import sys
  import os
  import math
  import itertools
  import numpy as np
  from collections import OrderedDict, deque
  from bisect import bisect_left, bisect_right, insort_left, insort_right
  sys.setrecursionlimit(10000)
  
  dx = [1, 0, -1, 0]
  dy = [0, 1, 0, -1]
  
  
  class EndLoop(Exception):
      pass
  
  
  def debug_print(L):
      for col in L:
          print(col)
  
  
  def debug_print_joined(L):
      for col in L:
          print("".join(col))
  
  
  def transpose_matrix(L):
      transposed = list(map(list, zip(*L)))
      return transposed
  
  
  def solve():
      N, K = map(int, input().split())
      x_coordinates = []
      y_coordinates = []
      for _ in range(N):
          x, y = map(int, input().split())
          x_coordinates.append(x)
          y_coordinates.append(y)
  
      x_coordinates_comb = []
      y_coordinates_comb = []
      for ele in itertools.combinations(x_coordinates, 2):
          x_coordinates_comb.append(ele)
  
      for ele in itertools.combinations(y_coordinates, 2):
          y_coordinates_comb.append(ele)
  
      min_area = 10e18
      for x in x_coordinates_comb:
          for y in x_coordinates_comb:
              cnt = 0
              for i in range(N):
                  if min(x) <= x_coordinates[i] <= max(x) and min(y) <= y_coordinates[i] <= max(y):
                      cnt += 1
  
              if cnt >= K:
                  min_area = min(min_area, (max(x) - min(x)) * (max(y) - min(y)))
  
      print(min_area)
  
  
  solve()
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."}]