// UUID: 250b3da0-7c87-46d8-b1c2-39e54b29ad21
#include <bits/stdc++.h>
using namespace std;

#

int main() {
	long long n, k;
	cin >> n >> k;

	long long pos = 0;
	vector<pair<long long, long long> > sor(n);
	deque<pair<pair<long long, long long>, int> > dq;
	vector<pair<pair<long long, long long>, int> > mo;
	for (pair<long long, long long> & x : sor) {
		cin >> x.first >> x.second;
	}
	sor.push_back({0, 0});
	for (int i = 0; i <= n; i++){
		pos += sor[i].first;
		while(dq.size() > 1 && dq.back().first.second >= sor[i].second){
			dq.pop_back();
		}
		dq.push_back({{pos - sor[i].first, sor[i].second}, i});
		if (dq.size() == 2 && dq[0].first.second >= dq[1].first.second){
			mo.push_back(dq[0]);
			dq.pop_front();
		}
		while (dq[0].first.first + k < pos){
			mo.push_back(dq[0]);
			dq.pop_front();
		}
	}
	mo.push_back(dq.back());

	long long curTank = 0, total_cost = 0;
	vector<pair<int, int> > outPut(mo.size() - 1);
	for (int i = 0; i < mo.size() - 1; i++){
		if (mo[i].first.second > mo[i + 1].first.second){
			total_cost += (mo[i + 1].first.first - mo[i].first.first - curTank) * mo[i].first.second;
			outPut[i] = {mo[i].second, mo[i + 1].first.first - mo[i].first.first - curTank};
			curTank = 0;
		}
		else {
			total_cost += (k - curTank) * mo[i].first.second;
			outPut[i] = {mo[i].second, (k - curTank)};
			curTank = k - (mo[i + 1].first.first - mo[i].first.first);
		}
	}

	cout << total_cost << " " << mo.size() - 1 << '\n';
	for (pair<int, int> x : outPut) cout << x.first + 1 << " " << x.second << '\n';
}