#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("shop.in");
ofstream fout ("shop.out");

long long n,c,i,l,r,p[35],k,sum,t[35],aux;

struct data {
    long long a;
    long long b;
    long long c;
}v[35];

bool cmp (data a, data b) {
    return a.a>b.a;
}

int main () {

    fin>>n>>c>>l;
    r=1;
    while (r<=l&&k<=32){
        p[k++]=r;
        r*=c;
    }
    for (i=1;i<=n;i++) {
        fin>>v[i].a>>v[i].b;
        v[i].c=i;
    }
    sort (v+1,v+n+1,cmp);
    for (i=1;i<=n;i++) {
        if (l==0)
            break;
        aux=min(l/p[v[i].a],v[i].b);
        t[v[i].c]=aux;
        sum+=aux;
        l-=aux*p[v[i].a];
    }
    fout<<sum<<"\n";
    for (i=1;i<=n;i++)
        fout<<t[i]<<" ";


    return 0;
}