#include <iostream>
#include <queue>
using namespace std;
using ll = long long;

ll n, k, t, g, ans, cnt = 0;
vector <ll> ar(4e5, 0);
vector <ll> l(4e5, 0);
deque <int> q;
vector <ll> z(4e5, 0);

void tank(int i) {
    l[i] = k;
    while (q.size() && ar[q.back()] > ar[i]) {
        l[i] += l[q.back()];
        q.pop_back();
    }
    q.push_back(i);
}

void go() {
    k = g;
    while (g) {
        int i = q.front();
        q.pop_front();
        ll h = min(g, l[i]);
        ans += h * ar[i];
        l[i] -= h;
        g -= h;
        z[i] += h;
        if (l[i]) q.push_front(i);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> g >> ar[i];
        tank(i);
        go();
    }
    for (int i = 1; i <= n; i++) if (z[i]) cnt++;
    cout << ans << " " << cnt << "\n";
    for (int i = 1; i <= n; i++) if (z[i]) cout << i << " " << z[i] << "\n";
}