#include <bits/stdc++.h>
using namespace std;
const int maxN = 100000 + 100;
pair<int, int> P[maxN];
int toAdd[maxN], cnt[500], rec[500][500];
long long old[maxN];
int main() {
  int n, w;
  cin >> n >> w;
  int maxB = 0, maxA = 0;
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    P[i] = make_pair(b, a);
    maxB = max(maxB, b);
    maxA = max(maxA, a);
  }
  sort(P, P + n);
  int blk;
  for (blk = 1; (blk + 1) * (blk + 1) <= maxA; ++blk)
    ;
  int cntBlk = maxA / blk + 1;
  for (int c = 0, cur = 0; c <= maxB + 1; ++c) {
    for (; cur < n && P[cur].first < c; ++cur) {
      int a = P[cur].second, m = a / blk;
      for (int i = 0; i < m; ++i) toAdd[i] += 1;
      for (int i = m * blk; i <= a; ++i) old[i] += i;
      cnt[m] = 0;
      int *Rec = rec[m], &Cnt = cnt[m];
      for (int i = m * blk; i < (m + 1) * blk && i <= maxA; ++i) {
        while (Cnt > 1 && (old[(Rec[Cnt - 1])] - old[(Rec[Cnt - 2])]) *
                                  (i - (Rec[Cnt - 1])) <=
                              (old[i] - old[(Rec[Cnt - 1])]) *
                                  ((Rec[Cnt - 1]) - (Rec[Cnt - 2])))
          --Cnt;
        Rec[Cnt++] = i;
      }
    }
    long long opt = 0;
    int optP = int(1e9);
    for (int i = 0; i < cntBlk; ++i) {
      if (!cnt[i]) continue;
      int l = 0, r = cnt[i] - 1, curP;
      while (l + 5 <= r) {
        int mid = (l + r) >> 1;
        if ((1ll * toAdd[i] * (rec[i][mid]) + old[rec[i][mid]]) >
            (1ll * toAdd[i] * (rec[i][mid + 1]) + old[rec[i][mid + 1]]))
          r = mid;
        else
          l = mid;
      }
      for (curP = l++; l <= r; ++l)
        if ((1ll * toAdd[i] * (rec[i][l]) + old[rec[i][l]]) >
            (1ll * toAdd[i] * (rec[i][curP]) + old[rec[i][curP]]))
          curP = l;
      if ((1ll * toAdd[i] * (rec[i][curP]) + old[rec[i][curP]]) > opt)
        opt = (1ll * toAdd[i] * (rec[i][curP]) + old[rec[i][curP]]),
        optP = rec[i][curP];
    }
    cout << 1ll * c * w * (n - cur) + opt << " " << optP << endl;
  }
  return 0;
}
