#include<stdio.h>
#define ll long long
#define minim(a,b) (a<b ? a : b)

ll n,nev,c,fol[54];
ll solm,s;
ll l,r;

struct shop
{
    ll x,y;
};
shop q[55];

int main ()
{
    ll i,j,z;
    freopen("shop.in","r",stdin);
    freopen("shop.out","w",stdout);
    scanf("%lld%lld%lld",&n,&c,&l);
    for(i=1;i<=n;i++)
        scanf("%lld%lld",&q[i].x,&q[i].y);
    for(i=1;i<=n;i++)
    {
        solm=0;
        for(j=1;j<=n;j++)
            if(q[j].x>solm)
                solm=q[j].x;
        for(j=1;j<=n;j++)
            if(solm==q[j].x)
                break;
        r=1;
        for(z=1;z<=q[j].x && r<=l;z++)
            r*=c;
        nev=l/r;
        nev=minim(nev,q[j].y);
        l-=nev*r;
        fol[j]=nev;
        q[j].x=-1;
    }
    for(i=1;i<=n;i++)
        s+=fol[i];
    printf("%lld\n",s);
    for(i=1;i<=n;i++)
        printf("%lld ",fol[i]);
    printf("\n");
    return 0;
}