#include <bits/stdc++.h>
using namespace std;
const int inf = -1000000007;
struct po {
  int x, y;
} a[100010];
struct node {
  int l, r, y, d;
} e[200010];
int b[200010], c[200010], s[200010], pre[200010], n, k, m;
long long ans[100010];
bool cmp(node a, node b) { return a.y < b.y; }
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a[i].x, &a[i].y);
    b[i] = a[i].x;
    b[i + n] = a[i].x + k;
  }
  sort(b + 1, b + 1 + 2 * n);
  c[1] = b[1];
  m = 1;
  for (int i = 2; i <= 2 * n; i++)
    if (b[i] != c[m]) c[++m] = b[i];
  for (int i = 1; i <= n; i++) {
    int l = lower_bound(c + 1, c + m + 1, a[i].x) - c;
    int r = lower_bound(c + 1, c + m + 1, a[i].x + k) - c;
    e[i] = (node){l, r, a[i].y, 1};
    e[i + n] = (node){l, r, a[i].y + k, -1};
  }
  sort(e + 1, e + 2 * n + 1, cmp);
  for (int i = 1; i <= 2 * n; i++) {
    for (int j = e[i].l; j < e[i].r; j++) {
      if (s[j]) ans[s[j]] += 1ll * (c[j + 1] - c[j]) * (e[i].y - pre[j]);
      s[j] += e[i].d;
      pre[j] = e[i].y;
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%I64d", ans[i]);
    if (i == n)
      cout << endl;
    else
      printf(" ");
  }
}
