#include<bits/stdc++.h>
using namespace std;
#define int long long
struct S{
	int d,c,i;
};
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
#ifndef ONLINE_JUDGE
	freopen("be1.txt","r",stdin);
#endif
	int N,K;
	cin>>N>>K;
	deque<S>q;
	map<int,int>m;
	int t=0;
	int ans=0;
	for(int i=1;i<=N;i++){
		int d,c;
		cin>>d>>c;
		while(!q.empty()&&c<q.back().c){
			t-=q.back().d;
			q.pop_back();
		}
		if(t<K){
			q.push_back({K-t,c,i});
		}
		t=K;
		while(!q.empty()&&q.front().d<=d){
			m[q.front().i]+=q.front().d;
			ans+=q.front().c*q.front().d;
			d-=q.front().d;
			t-=q.front().d;
			q.pop_front();
		}
		if(!q.empty()&&d>0){
			m[q.front().i]+=d;
			ans+=q.front().c*d;
			q.front().d-=d;
			t-=d;
		}
	}
	cout<<ans<<' '<<m.size()<<'\n';
	for(auto[a,b]:m){
		cout<<a<<' '<<b<<'\n';
	}
	return 0;
}