// UUID: db1d87cc-42b7-4a53-a78f-b08c78aad3a8
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;	cin>>n>>k;
	vector<pair<int, int>> a (n);
	vector<int> ne (n);
	vector<long long> dist(n+1);
	for(int i=0; i<n; i++){
		int x, y; cin>>x>>y;
		a[i]={y, x};
		dist[i+1]=dist[i]+a[i].second;
	}

	stack<pair<int, int>> s;
	s.push({0, n});
	for(int i=n-1; i>=0; i--){
		while(s.top().first>=a[i].first){
			s.pop();
		}
		ne[i]=s.top().second;
		s.push({a[i].first, i});
	}

	vector<pair<int, int>> ans;
	long long p=0, t=0;

	for(int i=0; i<n; i++){
		if(i!=0) {t-=a[i-1].second;}
		if(dist[ne[i]]-dist[i]<=k){
			if(dist[ne[i]]-dist[i] >t){
				ans.push_back({i+1, dist[ne[i]]-dist[i]-t});
				p+=(dist[ne[i]]-dist[i]-t)*a[i].first;
				t=dist[ne[i]]-dist[i];
			}
		}
		else{
			if(dist[n]-dist[i]<=k){
				if (t>= dist[n]-dist[i]){break;}
				ans.push_back({i+1, dist[n]-dist[i]-t});
				p+=dist[n]-dist[i]-t;
				break;
			}
			ans.push_back({i+1, k-t});
			p+=(k-t)*a[i].first;
			t=k;
		}
	}

	cout<<p<<" "<<ans.size()<<endl;
	for(auto i: ans){
		cout<<i.first<<" "<<i.second<<endl;
	}
}