// UUID: dbb8a864-a95e-4e46-a03e-4d0f7da0d829
// UUID: f9b27519-2e84-4482-8372-723d5a1506a8
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n; cin>>n;
	int k; cin>>k;
	vector<int> kov(n+1),ar(n+1);
	for(int i=1; i<=n; i++)
		cin>>kov[i]>>ar[i];
	vector<int> pref(n+1);
	for(int i=1; i<=n; i++)
		pref[i]=pref[i-1]+kov[i];
	vector<int> hany(n+1),marad(n+1, k);
	int ans=0;
	deque<int> q;
	for(int i=1; i<=n; i++)
	{
		while(!q.empty() && ar[i]<=ar[q.front()]) q.pop_front();
		q.push_front(i);
		int kell=kov[i];
		int tart=pref[i-1];
		while(kell>0)
		{
			while(!q.empty() && pref[q.back()]<tart-k) q.pop_back();
			int ind=q.back();
			int s=pref[ind]+k;
			int maxhany=s-tart;
			marad[ind]=min(marad[ind],maxhany);
			if(marad[ind]>kell)
			{
				hany[ind]+=kell;
				marad[ind]-=kell;
				tart+=kell;
				ans+=kell*ar[ind];
				kell=0;
			}
			else
			{
				hany[ind]+=marad[ind];
				kell-=marad[ind];
				ans+=marad[ind]*ar[ind];
				tart+=marad[ind];
				marad[ind]=0;
				q.pop_back();
			}
		}
	}
	vector<array<int, 2>> s;
	for(int i=1; i<=n; i++)
		if(hany[i]>0) s.push_back({i,hany[i]});
	cout<<ans<<" "<<s.size()<<"\n";
	for(auto &[a,b]:s)
		cout<<a<<" "<<b<<"\n";
}