#include <fstream>
#include <algorithm>
using namespace std;

ifstream f("shop.in"); ofstream g("shop.out");

struct moneda {int a, b, n;};

moneda v[35];
int r[35];
int c, l, n, i, j, a, b, t;

inline bool comp (moneda fx, moneda fy){ return fx.a>fy.a;}

int main(){
	f>>n>>c>>l;
	
	for (i=1; i<=n; i++){
		f>>a>>v[i].b;
		v[i].a=1;
		for (j=1; j<=a; j++) v[i].a*=c;
		v[i].n=i;
	}
	
	sort (v+1, v+n+1, comp);
		
	for (i=1; i<=n && l!=0; i++){
		while (v[i].b!=0 && v[i].a<=l){
			l-=v[i].a;
			v[i].b--;
			t++;
			r[v[i].n]++;
		}
	}
	
	g<<t<<"\n";
	for (i=1; i<=n; i++){
		g<<r[i]<<" ";
	}
}