#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int N = 100007;
struct node {
  int x, y, k;
} a[N << 1];
int n, m, cnt;
long long ans[N];
map<int, int> f;
inline bool operator<(const node& x, const node& y) {
  if (x.x != y.x)
    return x.x < y.x;
  else if (x.y != y.y)
    return x.y < y.y;
  else
    return x.k < y.k;
}
inline void init(int x, int y, int k) {
  a[++cnt].x = x, a[cnt].y = y, a[cnt].k = k;
}
inline void insert(int x) {
  f[a[x].y] += a[x].k;
  f[a[x].y + m] -= a[x].k;
  if (f[a[x].y] == 0) f.erase(a[x].y);
  if (f[a[x].y + m] == 0) f.erase(a[x].y + m);
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= n; i++) {
    int x = read(), y = read();
    init(x, y - m + 1, 1);
    init(x + m, y - m + 1, -1);
  }
  sort(a + 1, a + 1 + cnt);
  insert(1);
  for (int i = 2; i <= cnt; i++) {
    for (; i <= cnt && a[i].x == a[i - 1].x;) insert(i), i++;
    int last = 0, tot = 0;
    map<int, int>::iterator it;
    for (it = f.begin(); it != f.end(); it++) {
      if (tot) ans[tot] += 1ll * (it->first - last) * (a[i].x - a[i - 1].x);
      last = it->first;
      tot += it->second;
    }
    insert(i);
  }
  for (int i = 1; i <= n; i++) printf("%I64d ", ans[i]);
}
