#include <bits/stdc++.h>
using namespace std;
template <class T>
int getInd(vector<T>& base, T toFind) {
  return lower_bound(base.begin(), base.end(), toFind) - base.begin();
}
struct Operation {
  int y, x1, x2, toAdd;
};
bool operator<(Operation l, Operation r) { return l.y < r.y; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> xp;
  vector<Operation> op;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    op.push_back({y, x, x + k, 1});
    op.push_back({y + k, x, x + k, -1});
    xp.push_back(x);
    xp.push_back(x + k);
  }
  sort(op.begin(), op.end());
  sort(xp.begin(), xp.end());
  xp.resize(unique(xp.begin(), xp.end()) - xp.begin());
  vector<long long> result(n + 1, 0);
  vector<int> count(xp.size(), 0), lasty(xp.size(), 0);
  for (auto c : op) {
    for (int i = getInd(xp, c.x1); xp[i] < c.x2; i++) {
      result[count[i]] += (xp[i + 1] - xp[i]) * (c.y - lasty[i]);
      count[i] += c.toAdd;
      lasty[i] = c.y;
    }
  }
  for (int i = 1; i <= n; i++) cout << result[i] << ' ';
  cout << '\n';
  return 0;
}
