#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("shop.in");
ofstream g("shop.out");
int n,c,nrc,cc,k,inc;
long long s;
struct art{long long v;int m,consum,ord;}a[31];
int cmp(art e,art x)
{
    return e.v<x.v;
}
int cmp1(art e,art x)
{
    return e.ord<x.ord;
}
int main()
{   f>>n>>c>>s;
    for (int i=1;i<=n;i++)
    {
        f>>cc>>nrc;
        if (cc==0) { a[i].v=1; a[i].m=nrc; a[i].ord=i; }
            else {
                    a[i].v=1;
                    for (int j=1;j<=cc;j++)
                        a[i].v*=c;
                    a[i].m=nrc;
                    a[i].ord=i;
                 }
    }
    sort (a+1,a+n+1,cmp)
    k=n;
    while (s>0)
    {
        while (a[k].m>0 and s-a[k].v>=0)
        {
            s-=a[k].v;
            a[k].m--;
            a[k].consum++;
        }
        k--;
    sort (a+1,a+n+1,cmp1)
    }

    for (int i=1;i<=n;i++)
        inc+=a[i].consum;
    g<<inc<<'\n';
    for (int i=1;i<=n;i++)
        g<<a[i].consum<<' ';
    g.close();
    return 0;
}