#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("shop.in");
ofstream g("shop.out");
int n,c,a[31],b[31],Max,i,viz[100],b2[100],nr;
long long l,p[60];
int main()
{
    f>>n>>c>>l;
    for(i=1;i<=n;i++){
        f>>a[i]>>b[i];
        Max=max(a[i],Max);
        viz[a[i]]=i;
        b2[i]=b[i];
    }
    sort(a+1,a+n+1);
    p[0]=1;
    for(i=1;i<=Max;i++)
        p[i]=p[i-1]*c;
        i=n;
    while(l>0){
            while(l>=p[a[i]]&&b[viz[a[i]]]!=0){
                l-=p[a[i]];
                b[viz[a[i]]]--;
                nr++;
            }
            i--;

    }
    g<<nr<<'\n';
for(i=1;i<=n;i++)
    g<<b2[i]-b[i]<<' ';
    return 0;
}