{"raw_statement":[{"iden":"problem statement","content":"We have $N$ points in a two-dimensional plane.  \nThe coordinates of the $i$\\-th point $(1 \\leq i \\leq N)$ are $(x_i,y_i)$.  \nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains $K$ or more of the $N$ points in its interior.  \nHere, points on the sides of the rectangle are considered to be in the interior.  \nFind the minimum possible area of such a rectangle."},{"iden":"constraints","content":"*   $2 \\leq K \\leq N \\leq 50$\n*   $-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)$\n*   $x_i≠x_j (1 \\leq i<j \\leq N)$\n*   $y_i≠y_j (1 \\leq i<j \\leq N)$\n*   All input values are integers. (Added at 21:50 JST)"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$  \n$x_1$ $y_1$\n$:$  \n$x_{N}$ $y_{N}$"},{"iden":"sample input 1","content":"4 4\n1 4\n3 3\n6 2\n8 1"},{"iden":"sample output 1","content":"21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: $(1,1)$, $(8,1)$, $(1,4)$ and $(8,4)$.  \nIts area is $(8-1) × (4-1) = 21$."},{"iden":"sample input 2","content":"4 2\n0 0\n1 1\n2 2\n3 3"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999"},{"iden":"sample output 3","content":"3999999996000000001\n\nWatch out for integer overflows."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}