#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

LL X[110], Y[110];
int main() {
    
    
    int N = readInt();
    int K = readInt();
    
    REP(i, N) cin >> X[i] >> Y[i];
    
    LL ans = (1LL << 62);
    
    REP(lx, N){
        REP(rx, N){
            REP(ry, N){
                REP(ly, N){
                    
                    LL Area = 1LL * (Y[ry] - Y[ly]) * (X[rx] - X[lx]);
                    
                    int cnt = 0;
                    REP(i, N){
                        if(X[i] >= X[lx] && X[i] <= X[rx] && Y[i] >= Y[ly] && Y[i] <= Y[ry]) cnt++; 
                    }
                    
                    if(cnt >= K){
                        ans = min(ans, Area);
                    }
                }
            }
        }
    }
    cout << ans << endl;
    /*
    int N = readInt();
    int M = readInt();
    
    REP(i, N) {
        int a = readInt();
        A.push_back(a);
        mp[a]++;
    }
    
    for(auto e: mp){
        if(e.second>=2){
            cout << 0 << endl;
            return 0;
        }
    }
    
    REP(i, M){
        int b = readInt();
        B.push_back(b);
        mp[b]++;
    }
    
    for(int i=0; i<N; ++i){
        for(int j=0; j<M; ++j){
            arr.PB(min(A[i], B[j]));
        }
    }
    
    //for(int i=0; i<N*M; ++i) cout << arr[i] << endl;
    
    for(int i=0; i<N; ++i){
        for(int j=0; j<M; ++j){
            R[i].PB(arr[i*M+j]);
        }
        sort(R[i].begin(), R[i].end());
    }
    
    
    
    for(int i=0; i<M; ++i){
        for(int j=0; j<N; ++j){
            C[i].PB(arr[i*N+j]);   
        }
        sort(C[i].begin(), C[i].end());
    }
    
    sort(arr.begin(), arr.end());
    for(auto e: mp){
        if(e.second>=3){
            cout << 0 << endl;
            return 0;
        }else if(e.second==2){
            ok[e.first] = true;
        }
    }
    
    //for(int i=0; i<N*M; ++i) cout << arr[i] << endl;
    LL ans=1;
    for(int i=N*M; i>=2; --i){
        
        if(ok[i]){
            continue;
        }
        if((arr.end() - lower_bound(arr.begin(), arr.end(), i)) - (N*M-i) <= 0) {
            cout << 0 << endl;
            return 0;
        }
        if(find(A.begin(), A.end(), i)!=A.end()){
            auto e = find(A.begin(), A.end(), i) - A.begin();
            ans *= upper_bound(R[e].begin(), R[e].end(), i) - lower_bound(R[e].begin(), R[e].end(), i);
        }else if(find(B.begin(), B.end(), i)!=B.end()){
            auto e = find(B.begin(), B.end(), i) - B.begin();
            ans *= upper_bound(C[e].begin(), C[e].end(), i) - lower_bound(C[e].begin(), C[e].end(), i);
        }else{
        
        ans *= (arr.end() - lower_bound(arr.begin(), arr.end(), i)) - (N*M-i);
        
        }ans %= MOD;
    }
    cout << ans << endl;
    
    */
	return 0;
}

Measured memory_bytes: 384