#include <stdio.h>
#include <algorithm>

using namespace std;

typedef long long lint;

lint n,c,A[64],B[64],S,sol[64],C[64],nr,p[64];

void doit(lint S,int i)
{
    sol[p[i]]=min(B[p[i]],S/C[p[i]]);
    nr+=sol[p[i]];
    if(i)
	doit(S-sol[p[i]]*C[p[i]],i-1);
}

bool cmp(const int i,const int j)
{
    return A[i]<A[j]||(A[i]==A[j]&&i<j);
}

int main()
{
    int i,j;
    freopen("shop.in","r",stdin);
    freopen("shop.out","w",stdout);

    scanf("%lld %lld %lld",&n,&c,&S);
    for(i=0;i<n;++i)
    {
	scanf("%lld %lld",&A[i],&B[i]);
	for(p[i]=i,C[i]=1,j=0;C[i]<=S&&j<A[i];j++,C[i]*=c);
    }
    sort(p,p+n,cmp);
    doit(S,n-1);
    printf("%lld\n",nr);
    for(i=0;i<n;++i)
	printf("%lld ",sol[i]);
    printf("\n");
    return 0;
}