#include <bits/stdc++.h>
using namespace std;
const int N = 200055;
int n, k;
int fx1, fy1, fx2, fy2;
vector<int> xf;
vector<int> yf;
vector<int> xmin;
vector<int> xmax;
vector<int> ymin;
vector<int> ymax;
int x[N];
int y[N];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%d%d%d%d", &fx1, &fy1, &fx2, &fy2);
    x[i] = fx1 + fx2;
    y[i] = fy1 + fy2;
    xf.push_back(x[i]);
    yf.push_back(y[i]);
  }
  if (n == 1) {
    puts("1");
    return 0;
  }
  sort(xf.begin(), xf.end());
  sort(yf.begin(), yf.end());
  for (int i = 0; i < min((int)xf.size(), k + 1); ++i) {
    xmin.push_back(xf[i]);
  }
  for (int i = 0; i < k + 1; ++i) {
    if (i < (int)xf.size()) {
      xmax.push_back(xf[xf.size() - i - 1]);
    }
  }
  sort(xmax.begin(), xmax.end());
  for (int i = 0; i < min((int)yf.size(), k + 1); ++i) {
    ymin.push_back(yf[i]);
  }
  for (int i = 0; i < k + 1; ++i) {
    if (i < (int)yf.size()) {
      ymax.push_back(yf[yf.size() - i - 1]);
    }
  }
  long long res = 4000000000000000000LL;
  sort(ymax.begin(), ymax.end());
  for (int i = 0; i < (int)xmin.size(); ++i) {
    for (int j = 0; j < (int)xmax.size(); ++j) {
      int xleft = xmin[i], xright = xmax[j];
      if (xleft > xright) continue;
      int cnt = 0;
      for (int cur = 0; cur < n && cnt <= k; ++cur) {
        if (x[cur] > xright || x[cur] < xleft) cnt++;
      }
      if (cnt > k) continue;
      for (int ii = 0; ii < (int)ymin.size(); ++ii) {
        for (int jj = 0; jj < (int)ymax.size(); ++jj) {
          int yleft = ymin[ii], yright = ymax[jj];
          if (yleft > yright) continue;
          cnt = 0;
          int fv = (yright - yleft);
          if (fv % 2 != 0) fv++;
          if (!fv) fv = 2;
          int sv = (xright - xleft);
          if (sv % 2 != 0) sv++;
          if (!sv) sv = 2;
          if (1LL * fv * sv >= res) continue;
          for (int cur = 0; cur < n && cnt <= k; ++cur) {
            if (x[cur] > xright || x[cur] < xleft || y[cur] > yright ||
                y[cur] < yleft)
              cnt++;
          }
          if (cnt <= k) {
            res = min(res, 1LL * fv * sv);
          }
        }
      }
    }
  }
  if (res < 4) res = 4;
  cout << res / 4 << endl;
  return 0;
}
