// UUID: 1376a8c6-3da4-4433-b0e3-79bb6a12966b
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0);cin.tie(0);
	int n,k;cin>>n>>k;
    vector<int>cost(n+2),dis(n+2,0),pref(n+2,0),p(n+2,0);
    for(int i=1;i<=n;i++){
        cin>>dis[i]>>cost[i];
        pref[i+1]=pref[i]+dis[i];
    }
    deque<int>deq;
    for(int i=1;i<=n+1;i++){
        while(!deq.empty() && pref[i]-pref[deq.front()]>=k)deq.pop_front();
        p[i]=deq.front();
        while(!deq.empty() && cost[deq.back()]>=cost[i])deq.pop_back();
        deq.push_back(i);
    }
    //for(int i=1;i<=n+1;i++)cout<<p[i]<<' ';
    vector<int>t;
    int c=n+1;
    while(c!=1){
        t.push_back(c);
        c=p[c];
    }
    t.push_back(1);
    reverse(t.begin(),t.end());
    //for(int x:t)cout<<x<<' ';
    int pay=0, tank=0;
    vector<pair<int,int>>ans;
    for(int i=0;i<t.size()-1;i++){
        if(cost[t[i+1]]<cost[t[i]]){
            ans.push_back({t[i],pref[t[i+1]]-pref[t[i]]-tank});
            pay+=(pref[t[i+1]]-pref[t[i]]-tank)*cost[t[i]];
            tank=max(0,tank-(pref[t[i+1]]-pref[t[i]]));
        }
        else{
            ans.push_back({t[i],k-tank});
            pay+=(k-tank)*cost[t[i]];
            tank=k-(pref[t[i+1]]-pref[t[i]]);
        }
    }
    cout<<pay<<' '<<ans.size()<<'\n';
    for(pair<int,int> x:ans)cout<<x.first<<' '<<x.second<<'\n';
}