/// Containers Start
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
/// C Header Files
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <math.h>
#include <stdio.h>
/// Containers End

using namespace std;

/// Math Start
#define PI acos(-1.0)
#define Pi 3.141592653589793
#define EPS (1e-7)
#define INF 1e+18
#define MAX_V 100100
/// Math End

/// Extra Start
#define nn '\n'
#define pb push_back
#define ull unsigned long long
#define ll long long
#define MOD 1000000007
#define sz(a) int((a).size())
#define space " "
#define All(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
/// Extra End

#define rep(i, n) for (int i = 0; i < n; i++)
#define Cini(a)                                                                \
    int a;                                                                     \
    cin >> a;
#define Cinii(a, b)                                                            \
    int a, b;                                                                  \
    cin >> a >> b;
#define Ciniii(a, b, c)                                                        \
    int a, b, c;                                                               \
    cin >> a >> b >> c;
#define Cins(s)                                                                \
    string s;                                                                  \
    cin >> s;
#define Cinss(s1, s2)                                                          \
    string s1, s2;                                                             \
    cin >> s1 >> s2;
#define Cinc(c)                                                                \
    char c;                                                                    \
    cin >> c;
/// Functions End

/// Graph Start
struct edge {
    int from, to;
    long long cost;
};
/// Graph End

/// Debug Start
#define deb(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << '\t' << #y << ": " << y << endl;
#define deb3(x, y, z)                                                          \
    cout << #x << ": " << x << '\t' << #y << ": " << y << '\t' << #z << ": "   \
         << z << endl;
/// Debug End

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

/**>>>>>>>>>>>>>>>>>>> END <<<<<<<<<<<<<<<<<<**/

/// template

signed main(void) {
    cin.sync_with_stdio(false);
    cin.tie(0);
    Cinii(N, K);
    vector<ll> x(N), y(N);
    vector<pair<ll, ll> > p(N);
    rep(i, N) {
        cin >> x[i] >> y[i];
        p[i].first = x[i];
        p[i].second = y[i];
    }
    vector<ll> area;
    rep(i, N) rep(j, N) rep(s, N) rep(t, N) {
        ll lx, ly, ux, uy;
        ll llx, lly, uux, uuy;
        lx = min(p[i].first, p[j].first);
        ux = max(p[i].first, p[j].first);
        ly = min(p[i].second, p[j].second);
        uy = max(p[i].second, p[j].second);
        llx = min(p[s].first, p[t].first);
        uux = max(p[s].first, p[t].first);
        lly = min(p[s].second, p[t].second);
        uuy = max(p[s].second, p[t].second);
        lx = min(lx, llx);
        ux = max(ux, uux);
        ly = min(ly, lly);
        uy = max(uy, uuy);
        int count = 0;
        rep(k, N) {
            if (lx <= p[k].first && p[k].first <= ux && ly <= p[k].second &&
                p[k].second <= uy) {
                count++;
            }
        }
        if (count >= K) {
            area.push_back((ux - lx) * (uy - ly));
        }
    }

    cout << *min_element(All(area)) << nn;
    return 0;
}

Measured memory_bytes: 67296