Problem: Snow Queen told Kay to form a word "eternity" using pieces of ice. Kay is eager to deal with the task, because he will then become free, and Snow Queen will give him all the world and a pair of skates.

Behind the palace of the Snow Queen there is an infinite field consisting of cells. There are n pieces of ice spread over the field, each piece occupying exactly one cell and no two pieces occupying the same cell. To estimate the difficulty of the task Kay looks at some squares of size k × k cells, with corners located at the corners of the cells and sides parallel to coordinate axis and counts the number of pieces of the ice inside them.

This method gives an estimation of the difficulty of some part of the field. However, Kay also wants to estimate the total difficulty, so he came up with the following criteria: for each x (1 ≤ x ≤ n) he wants to count the number of squares of size k × k, such that there are exactly x pieces of the ice inside.

Please, help Kay estimate the difficulty of the task given by the Snow Queen.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ 300) — the number of pieces of the ice and the value k, respectively. Each of the next n lines contains two integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — coordinates of the cell containing i-th piece of the ice. It's guaranteed, that no two pieces of the ice occupy the same cell.

Output

Print n integers: the number of squares of size k × k containing exactly 1, 2, ..., n pieces of the ice.

Example

Input

5 3
4 5
4 6
5 5
5 6
7 7


Output

10 8 1 4 0 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 29) + 5;
const long long int LLINF = (1ll << 59) + 5;
const int MOD = 1000 * 1000 * 1000 + 7;
const int MAX_N = 1000 * 100 + 5;
const int MAX_K = 305;
struct point {
  int x;
  int y;
};
struct ask {
  int l;
  int r;
  int ptr;
  int type;
};
bool cmp(const ask &a, const ask &b) {
  if (a.ptr != b.ptr) return a.ptr < b.ptr;
  if (a.l != b.l) return a.l < b.l;
  if (a.r != b.r) return a.r < b.r;
  return a.type < b.type;
}
int n, k;
point arr[MAX_N];
int cord[MAX_N * 2];
ask asks[MAX_N * 2];
int cord_len = 0;
int asks_len = 0;
bool have_prev_cord[MAX_N * 2];
bool have_prev_line[MAX_N * 2];
int last_of_cord[MAX_N * 2];
int last_of_line[MAX_N * 2];
int at_cord[MAX_N * 2];
int at_line[MAX_N * 2];
long long int answer[MAX_N];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> arr[i].x >> arr[i].y;
    cord[cord_len++] = arr[i].x;
    cord[cord_len++] = arr[i].x - k + 1;
  }
  sort(cord, cord + 2 * n);
  cord_len = unique(cord, cord + 2 * n) - cord;
  for (int i = 0; i < n; ++i) {
    asks[asks_len].l =
        lower_bound(cord, cord + cord_len, arr[i].x - k + 1) - cord;
    asks[asks_len].r = lower_bound(cord, cord + cord_len, arr[i].x) - cord;
    asks[asks_len].ptr = arr[i].y - k + 1;
    asks[asks_len].type = 1;
    ++asks_len;
    asks[asks_len].l = asks[asks_len - 1].l;
    asks[asks_len].r = asks[asks_len - 1].r;
    asks[asks_len].ptr = arr[i].y + 1;
    asks[asks_len].type = -1;
    ++asks_len;
  }
  sort(asks, asks + asks_len, cmp);
  memset(answer, 0, sizeof(answer));
  memset(last_of_cord, 0, sizeof(last_of_cord));
  memset(last_of_line, 0, sizeof(last_of_line));
  memset(at_cord, 0, sizeof(at_cord));
  memset(at_line, 0, sizeof(at_line));
  memset(have_prev_cord, 0, sizeof(have_prev_cord));
  memset(have_prev_line, 0, sizeof(have_prev_cord));
  for (int i = 0; i < asks_len; ++i) {
    for (int j = asks[i].l; j <= asks[i].r; ++j) {
      if (!have_prev_cord[j]) {
        have_prev_cord[j] = true;
        last_of_cord[j] = asks[i].ptr;
        at_cord[j] += asks[i].type;
      } else {
        answer[at_cord[j]] += asks[i].ptr - last_of_cord[j];
        last_of_cord[j] = asks[i].ptr;
        at_cord[j] += asks[i].type;
      }
      if (j != asks[i].r) {
        if (!have_prev_line[j]) {
          have_prev_line[j] = true;
          last_of_line[j] = asks[i].ptr;
          at_line[j] += asks[i].type;
        } else {
          answer[at_line[j]] += (long long int)1 * (cord[j + 1] - cord[j] - 1) *
                                (asks[i].ptr - last_of_line[j]);
          last_of_line[j] = asks[i].ptr;
          at_line[j] += asks[i].type;
        }
      }
    }
  }
  for (int i = 1; i <= n; ++i) cout << answer[i] << " ";
  puts("");
  return 0;
}