// UUID: 49e1ca75-18a0-4af6-b184-7a8236062f11
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> d(n), c(n), dp(n), prefix(n+1);
	for(int i=0;i<n;i++) cin >> d[i] >> c[i];
	for(int i=1;i<=n;i++) prefix[i]=prefix[i-1]+d[i-1];
	deque<int> dq;
	int gas=0;
	long long cost=0;
	vector<int> capacity(n, k);
	for(int i=0;i<n;i++){
		while(!dq.empty() && c[i]<c[dq.back()]) dq.pop_back();
		while(!dq.empty() && k<prefix[i]-prefix[dq.front()]) dq.pop_front();
		dq.push_back(i);
		bool repeat=true;
		int dist=d[i];
		while(repeat){
			repeat=false;
			gas-=d[i];
			int amount=min(capacity[dq.front()], min(k-gas, dist));
			dist-=amount;
			capacity[dq.front()]-=amount;
			cost+=amount*c[dq.front()];
			gas+=amount;
			//cout << dq.front() << ' ' << amount << '\n';
			if(capacity[dq.front()]<=0){
				dq.pop_front();
				repeat=true;
			}
		}
	}
	int tankNum=0;
	for(int x : capacity) tankNum+=(x<k);
	cout << cost << ' ' << tankNum << '\n';
	for(int i=0;i<n;i++) if(capacity[i]<k) cout << i+1 << ' ' << k-capacity[i] << '\n';
}