Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const uint32_t MAX_N = 1.01e5;
const uint32_t BUCKET_SIZE = 200;
const uint32_t MAX_BUCK = MAX_N / BUCKET_SIZE;
inline int64_t ceil_r(int64_t n, int64_t d) {
  if (d < 0) {
    n *= -1;
    d *= -1;
  }
  if (n < 0) {
    return n / d;
  } else {
    return (n + d - 1) / d;
  }
}
struct Line {
  int64_t a, b;
  Line(int64_t a = 0, int64_t b = 0) : a(a), b(b) {}
  int64_t operator()(int64_t x) const { return a * x + b; }
  static int64_t intersect_x(const Line &l1, const Line &l2) {
    int64_t num = l2.b - l1.b;
    int64_t denum = l1.a - l2.a;
    return ceil_r(num, denum);
  }
};
uint32_t priceCnt[MAX_N + BUCKET_SIZE];
struct Bucket {
  uint32_t start, len;
  uint32_t size;
  std::vector<std::pair<Line, int64_t>> lines;
  Bucket() : start(0), len(BUCKET_SIZE), size(0) {}
  void recalc() {
    std::vector<Line> tempLines(len);
    size = 0;
    for (uint32_t i = 0; i < len; i++) {
      int64_t j = start + len - i - 1;
      size += priceCnt[j];
      tempLines[j - start] = Line(j, size * j);
    }
    lines.clear();
    for (uint32_t i = 0; i < tempLines.size(); i++) {
      while (!lines.empty()) {
        int64_t x = Line::intersect_x(lines.back().first, tempLines[i]);
        if (x <= lines.back().second) {
          lines.pop_back();
        } else {
          break;
        }
      }
      int64_t startX = 0;
      if (!lines.empty()) {
        startX = Line::intersect_x(lines.back().first, tempLines[i]);
      }
      if (startX < 2 * MAX_N) {
        lines.push_back({tempLines[i], startX});
      }
    }
  }
  std::pair<int64_t, int64_t> best_val(int64_t x) {
    uint32_t l = 0;
    uint32_t h = lines.size();
    while (h - l > 1) {
      uint32_t m = (h + l) / 2;
      if (lines[m].second <= x) {
        l = m;
      } else {
        h = m;
      }
    }
    return {lines[l].first(x), lines[l].first.a};
  }
};
Bucket buckets[MAX_BUCK];
struct Person {
  uint32_t a, b;
  uint32_t bucket() const { return a / BUCKET_SIZE; }
  friend bool operator<(const Person &a, const Person &b) { return a.b < b.b; }
};
std::vector<Person> people;
int64_t adPrice;
uint32_t maxBanner;
void input() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  uint32_t peopleCnt;
  std::cin >> peopleCnt >> adPrice;
  people.resize(peopleCnt);
  maxBanner = 0;
  for (Person &i : people) {
    std::cin >> i.a >> i.b;
    maxBanner = std::max(maxBanner, i.b);
  }
  std::sort(people.begin(), people.end());
}
void init_buckets() {
  for (uint32_t i = 0; i < MAX_BUCK; i++) {
    buckets[i].start = i * BUCKET_SIZE;
    buckets[i].recalc();
  }
}
std::pair<int64_t, int64_t> calc() {
  std::pair<int64_t, int64_t> ans = {0, 0};
  uint32_t curCnt = 0;
  for (uint32_t i = MAX_BUCK - 1; i < MAX_BUCK; i--) {
    auto curAns = buckets[i].best_val(curCnt);
    ans = std::max(ans, curAns);
    curCnt += buckets[i].size;
  }
  return ans;
}
int main() {
  input();
  init_buckets();
  uint32_t peopleI = 0;
  int64_t curPeople = people.size();
  for (uint32_t i = 0; i <= 1 + maxBanner; i++) {
    while ((peopleI < people.size()) && (people[peopleI].b < i)) {
      uint32_t a = people[peopleI].a;
      priceCnt[a]++;
      buckets[a / BUCKET_SIZE].recalc();
      peopleI++;
      curPeople--;
    }
    int64_t adRevenue = curPeople * i * adPrice;
    auto ans = calc();
    std::cout << ans.first + adRevenue << " " << ans.second << "\n";
  }
}