// UUID: 026eef6b-6f5f-4840-8776-dfc04f99b63b
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define vi vector<int>
#define pii pair<int,int>

const int maxn=3e5+1;

vector<int> tree(maxn);

int f(int x){
    return x&(-x);
}

int get(int x){
    x=x+1;
    int res=0;
    while (x>0){
        res+=tree[x];
        x-=f(x);
    }
    return res;
}

void add(int x, int val){
    x=x+1;
    while (x<maxn){
        tree[x]+=val;
        x+=f(x);
    }
}

struct kut {
    int loc;
    int price;
    int ind;

    bool operator> (const kut &other) const {
        return price>other.price;
    }
};

void solve(){
    int n, k;
    cin>>n>>k;
    priority_queue<kut, vector<kut>, greater<kut>> q;
    int cur=0;
    vector<kut> ans;
    int loc=0;
    ll total=0;
    for (int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        q.push({loc, b, i});
        loc+=a;
        cur-=a;
        while (cur<0){
            while (!ans.empty() && !q.empty() && q.top().loc<ans.back().loc) q.pop();
			if (q.size()==0) {
				exit(0);
			}
            auto v = q.top();
            q.pop();
            int space = k+v.loc-get(v.loc);
            if (space<=-cur){
                cur+=space;
                add(v.loc, space);
                ans.push_back({v.loc, space, v.ind});
                total+=space*v.price;
            }
            else {
                add(v.loc, -cur);
                q.push(v);
                ans.push_back({v.loc, -cur, v.ind});
                total+=(-cur)*v.price;
                cur=0;
            }
        }
    }
    vector<int> kutak(n);
    int cnt=0;
    for (auto i : ans){
        kutak[i.ind]+=i.price;
    }
    for (int i : kutak) if (i) cnt++;
    cout<<total<<" "<<cnt<<"\n";
    for (int i=0;i<n;i++){
        if (kutak[i]) cout<<i+1<<" "<<kutak[i]<<"\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t=1;
    //cin>>t;
    while (t--){
        solve();
    }
}