#include <bits/stdc++.h>
using namespace std;
namespace std {
template <class S, class T>
struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T>
struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v) h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
}  // namespace std
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < (int)v.size(); i++)
    os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v) os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v) os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int n, k;
  scanf("%d%d", &n, &k);
  vector<long long> ans(n);
  vector<pair<int, int>> v;
  vector<pair<int, pair<int, int>>> ev;
  for (int i = 0; i < (int)n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    v.push_back(make_pair(a, b));
    ev.push_back(make_pair(a - k + 1, make_pair(1, i)));
    ev.push_back(make_pair(a + 1, make_pair(-1, i)));
  }
  sort((ev).begin(), (ev).end());
  map<int, int> ys;
  for (int i = 0; i < (int)ev.size() - 1; i++) {
    int x = ev[i].first, nx = ev[i + 1].first;
    int y = v[ev[i].second.second].second;
    if (ev[i].second.first >= 0)
      ys[y - k + 1]++, ys[y + 1]--;
    else {
      if (--ys[y - k + 1] == 0) ys.erase(y - k + 1);
      if (++ys[y + 1] == 0) ys.erase(y + 1);
    }
    if (nx - x == 0) continue;
    int cnt = 0, prev = inf;
    for (pair<int, int> p : ys) {
      if (cnt) ans[cnt - 1] += (long long)(nx - x) * (p.first - prev);
      cnt += p.second;
      prev = p.first;
    }
  }
  for (int i = 0; i < (int)ans.size(); i++)
    printf("%I64d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
  return 0;
}
