All modern mobile applications are divided into free and paid. Even a single application developers often release two versions: a paid version without ads and a free version with ads.

<image>

Suppose that a paid version of the app costs p (p is an integer) rubles, and the free version of the application contains c ad banners. Each user can be described by two integers: ai — the number of rubles this user is willing to pay for the paid version of the application, and bi — the number of banners he is willing to tolerate in the free version.

The behavior of each member shall be considered strictly deterministic:

  * if for user i, value bi is at least c, then he uses the free version, 
  * otherwise, if value ai is at least p, then he buys the paid version without advertising, 
  * otherwise the user simply does not use the application. 



Each user of the free version brings the profit of c × w rubles. Each user of the paid version brings the profit of p rubles.

Your task is to help the application developers to select the optimal parameters p and c. Namely, knowing all the characteristics of users, for each value of c from 0 to (max bi) + 1 you need to determine the maximum profit from the application and the corresponding parameter p.

Input

The first line contains two integers n and w (1 ≤ n ≤ 105; 1 ≤ w ≤ 105) — the number of users and the profit from a single banner. Each of the next n lines contains two integers ai and bi (0 ≤ ai, bi ≤ 105) — the characteristics of the i-th user.

Output

Print (max bi) + 2 lines, in the i-th line print two integers: pay — the maximum gained profit at c = i - 1, p (0 ≤ p ≤ 109) — the corresponding optimal app cost. If there are multiple optimal solutions, print any of them.

Examples

Input

2 1
2 0
0 2


Output

0 3
3 2
4 2
2 2


Input

3 1
3 1
2 2
1 3


Output

0 4
3 4
7 3
7 2
4 2
#include <bits/stdc++.h>
using namespace std;
int read() {
  char ch = getchar();
  int x = 0;
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x;
}
const int maxn = 1e5 + 5, maxs = 320;
int N, M, K, B, W, T, L[maxn], R[maxn];
vector<int> G[maxn];
long long d[maxn];
double slp(int x, int y) { return (1.0 * d[x] - d[y]) / (y - x); }
struct Block {
  int q[maxs], l, r, coef;
  void build(int x) {
    l = 0, r = -1;
    for (int i = L[x]; i <= R[x]; ++i) {
      while (r - l > 0 && slp(q[r - 1], q[r]) > slp(q[r], i)) --r;
      q[++r] = i;
    }
  }
  long long Get() {
    if (l > r) return 0;
    while (r - l > 0 && slp(q[l], q[l + 1]) < coef) ++l;
    return d[q[l]] + 1LL * q[l] * coef;
  }
} s[maxs];
int main() {
  N = read(), W = read();
  for (int i = 1, a, b; i <= N; ++i) {
    a = read(), b = read();
    G[b].push_back(a);
    K = max(K, b + 1);
    M = max(M, a);
  }
  B = sqrt(M);
  T = (M - 1) / B + 1;
  for (int i = 1; i <= T; ++i) L[i] = (i - 1) * B + 1, R[i] = min(i * B, M);
  for (int i = 1; i <= T; ++i) s[i].build(i);
  for (int k = 0; k <= K; ++k) {
    if (k)
      for (int i = 0, p; i < G[k - 1].size(); ++i) {
        --N;
        p = G[k - 1][i];
        for (int j = 1; j <= p / B; ++j) ++s[j].coef;
        for (int j = p / B * B + 1; j <= p; ++j) d[j] += j;
        s[p / B + 1].build(p / B + 1);
      }
    int ret = 1;
    for (int i = 1; i <= T; ++i)
      if (s[ret].Get() < s[i].Get()) ret = i;
    printf("%lld %d\n", 1LL * k * N * W + s[ret].Get(), s[ret].q[s[ret].l]);
  }
  return 0;
}
