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;
struct node {
  long long x, y;
  friend bool operator<(const node &a, const node &b) { return a.x < b.x; }
} p[100010];
pair<long long, int> mx, tmp;
long long crs(node a, node b, node c) {
  return 1ll * (b.x - a.x) * (c.y - a.y) - 1ll * (c.x - a.x) * (b.y - a.y);
}
struct convex {
  node p[400], stk[400];
  int top, sz, now, x;
  void built() {
    top = 0;
    now = 1;
    for (int i = 1; i <= sz; i++) {
      while (top > 1 && crs(stk[top - 1], p[i], stk[top]) <= 0) top--;
      stk[++top] = p[i];
    }
  }
  long long getans(node a, int x) { return a.y + x * a.x; }
  pair<long long, int> query() {
    while (now <= top && getans(stk[now], x) < getans(stk[now + 1], x)) now++;
    return make_pair(getans(stk[now], x), stk[now].x);
  }
} q[400];
int now = 1, n, s, tot;
long long w;
int main() {
  scanf("%d%I64d", &n, &w);
  for (int i = 1; i <= n; i++) scanf("%I64d%I64d", &p[i].y, &p[i].x);
  for (int i = 1; i <= n; i++) tot = max(1ll * tot, p[i].y);
  sort(p + 1, p + 1 + n);
  s = sqrt(tot);
  for (int i = 1; i <= tot / s + 1; i++) {
    for (int j = 1; j <= s; j++) q[i].p[j] = (node){(i - 1) * s + j, 0};
    q[i].sz = s;
    q[i].built();
  }
  for (int i = 0; now <= n; i++) {
    mx = make_pair(0, 0);
    for (; now <= n && p[now].x < i; now++) {
      for (int j = (p[now].y - 1) / s * s + 1; j <= p[now].y; j++)
        q[(p[now].y - 1) / s + 1].p[j - (p[now].y - 1) / s * s].y += j;
      q[(p[now].y - 1) / s + 1].built();
      for (int j = 1; j <= (p[now].y - 1) / s; j++) q[j].x++;
    }
    for (int j = 1; j <= tot / s + 1; j++) {
      tmp = q[j].query();
      if (tmp.first > mx.first) mx = tmp;
    }
    printf("%I64d %d\n", mx.first + (n - now + 1) * w * i, mx.second);
  }
  return 0;
}
