// UUID: 5160fbd5-cbb2-4b04-97f3-89367451dd9f
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n , k;cin >> n >> k;
	vector<int> a , b;
	for(int i = 0; i < n; i++){
		int c , d; cin >> c >> d;
		a.push_back(c);
		b.push_back(d);
	}
	b.push_back(-1);
	vector<int> c(n+1 , 0);
	vector<int> d(n+1 , 0);
	stack<int> s;s.push(n);
	for(int i = n-1; i >= 0; i--){
		while(b[s.top()] > b[i])s.pop();
		d[i] = s.top();
		s.push(i);
	}
	int j = 0 , h = 0;
	vector<int> ans(n , 0);
	int g = 0;
	for(int i = 0; i < n; i++){
		int o = a[i];
		while(o > 0){
			while(i >= d[j] || h == k){
				j++;
				h += c[j];
			}
			int p = min(o , k-h);
			c[i+1] -= p;
			g += p*b[j];
			ans[j] += p;
			h += p;
			o -= p;
		}
	}
	cout << g << " ";
	vector<array<int , 2>> an;
	for(int i = 0; i < n; i++){
		if(ans[i] > 0){
			an.push_back({i+1 , ans[i]});
		}
	}
	cout << an.size() << endl;
	for(auto x : an) cout << x[0] << " " << x[1] << "\n";
	
}