#include <bits/stdc++.h>
using namespace std;
struct ques {
  int k, y, x;
};
const int N = 100010;
int n, k, num;
pair<int, int> a[N];
int c[N * 300], d[N * 300];
long long ans[N];
ques q[N * 2];
int cmp(ques a, ques b) { return a.y < b.y; }
int find(int x) {
  int l = 1, r = num;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (c[mid] == x) return mid;
    if (c[mid] < x)
      l = mid + 1;
    else
      r = mid - 1;
  }
  return l;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].first, &a[i].second);
  sort(a + 1, a + 1 + n);
  a[n + 1].first = 2000000000;
  num = 0;
  for (int i = 1; i <= n; i++)
    for (int j = a[i].first; j < a[i].first + k && j < a[i + 1].first; j++)
      c[++num] = j;
  for (int i = 1; i <= n; i++) {
    q[i * 2 - 1] = (ques){1, a[i].second, a[i].first};
    q[i * 2] = (ques){-1, a[i].second + k, a[i].first};
  }
  sort(q + 1, q + 1 + n * 2, cmp);
  for (int i = 1; i <= n * 2; i++) {
    int p = find(q[i].x);
    for (int j = p; j < p + k; j++) {
      ans[d[j]] += q[i].y;
      d[j] += q[i].k;
      ans[d[j]] -= q[i].y;
    }
  }
  for (int i = 1; i <= n; i++) printf("%lld ", ans[i]);
  return 0;
}
