#include <bits/stdc++.h>
using namespace std;
const int N=55,M=550;
struct node {
    int x,y;
} a[N];
int n,k,mi[N][N],mx[N][N],flag1[M],flag2[M],ans=1e9;
void dfs(int step)
{
    cout<<step<<endl;
    if (step==n+1)
    {
        int cnt=0,u=0;
        for (int i=1;i<=k;i++)
        {
            if (mx[i][1]==1e9 || mx[i][2]==1e9 || mi[i][1]==-1 || mi[i][2]==-1) continue;
            if (flag1[mx[i][1]] || flag2[mx[i][2]] || flag1[mi[i][1]] || flag2[mi[i][2]]) u=1; break;
            cnt+=(mx[i][1]-mi[i][1])*(mx[i][2]-mi[i][2]);
        }
        if (!u && cnt>=0 && cnt<ans)
        {
            ans=cnt;
        }
        memset(flag1,0,sizeof(flag1));
        memset(flag2,0,sizeof(flag2));
        return ;
    }
    for (int i=1;i<=k;i++)
    {
        int ax=-1,ay=-1,bx=-1,by=-1;
        if (a[step].x<mi[i][1])
        {
            ax=mi[i][1];
            mi[i][1]=a[step].x;
        }
        if (a[step].x>mx[i][1])
        {
            bx=mx[i][1];
            mx[i][1]=a[step].x;
        }
        if (a[step].y<mi[i][2])
        {
            ay=mi[i][2];
            mi[i][2]=a[step].y;
        }
        if (a[step].y>mx[i][2])
        {
            by=mx[i][2];
            mx[i][2]=a[step].y;
        }
        dfs(step+1);
        if (ax!=-1)
        {
            mi[i][1]=ax;
        }
        if (bx!=-1)
        {
            mx[i][1]=bx;
        }
        if (ay!=-1)
        {
            mi[i][2]=ay;
        }
        if (by!=-1)
        {
            mx[i][2]=bx;
        }
    }
}
int main() {
    freopen("jxfg.in","r",stdin);
    freopen("jxfg.out","w",stdout); 
    cin>>n>>k;
    for (int i=1;i<=n;i++)
    {
        scanf("%d%d",&a[i].x,&a[i].y);
        mi[i][1]=1e9,mi[i][2]=1e9;
        mx[i][1]=-1,mx[i][2]=-1;
    }
    int mx1=-1,mx2=-1,mi1=1e9,mi2=1e9;
    if (k==1)
    {
        for (int i=1;i<=n;i++)
        {
            if (a[i].x>mx1)
            {
                mx1=a[i].x;
            }
            if (a[i].x<mi1)
            {
                mi1=a[i].x;
            }
            if (a[i].y>mx2)
            {
                mx2=a[i].y;
            }
            if (a[i].y<mi2)
            {
                mi2=a[i].y;
            }
        }
        printf("%d",(mx1-mi1)*(mx2-mi2));
        return 0;
    }
    dfs(1);
    printf("%d",ans);
}