#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<array<int, 2>> a(n); //kov, ar
    for(int i = 0; i < n; i++){
        cin >> a[i][0] >> a[i][1];
    }
    deque<array<int, 3>> dq; //ar, db
    int szaml = 0;
    map<int, int> m;
    for(int i = 0; i < n; i++){
        int c = (i > 0 ? a[i - 1][0] : k);
        while(!dq.empty() && dq.back()[0] > a[i][1]){
            c += dq.back()[1];
            dq.pop_back();
        }
        if(c != 0) dq.push_back({a[i][1], c, i + 1});
        int b = a[i][0];
        while(!dq.empty() && b > 0){
            int h = min(b, dq.front()[1]);
            szaml += h * dq.front()[0];
            m[dq.front()[2]] += h;
            b -= h;
            dq.front()[1] -= h;
            if(dq.front()[1] == 0) dq.pop_front();
        }
    }
    cout << szaml << " " << m.size() << "\n";
    for(auto [x, y] : m) cout << x << " " << y << "\n";
}