#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 300005;

ll n, k, pref[N], cost[N], nxt[N];

int main()
{
	FAST;
	cin >> n >> k;

	ll tot = 0;

	for(int i = 1; i <= n; ++i){
		ll dist; cin >> dist >> cost[i];
		assert(cost[i]);
		pref[i] = tot;
		tot += dist;
	}

	cost[n+1] = -1;
	pref[n+1] = tot;

	nxt[n] = n+1;
	for(int i = n-1; i >= 1; --i){
		nxt[i] = i+1;
		while(i != n+1 && cost[nxt[i]] >= cost[i]) nxt[i] = nxt[nxt[i]];
	}

	vector<ar<int,2>> ans;
	ans.reserve(N);

	tot = 0;
	int i = 1, tank = 0;
	while(i < n+1){
		int j = nxt[i];
	    ll dist = pref[j] - pref[i];

		if(dist <= k){
			if(dist - tank > 0){
				ans.pb({i, dist-tank});
				tot += (dist-tank)*cost[i];
				tank += (dist-tank);
			}
			tank -= dist;
			assert(j > i);
			i = j;
		}else{
			ll dist = pref[i+1] - pref[i];
			if(k-tank > 0){
				ans.pb({i, k - tank});
				tot += (k-tank) * cost[i];
				tank = k;
			}
			tank -= dist;
			++i;
		}
	}

	cout << tot << ' ' << ans.size() << '\n';
	for(auto [id, amnt] : ans) cout << id << ' ' << amnt << '\n';

	return 0;
}