#include <cstdio>
#define nmax 35
using namespace std;
long long a[nmax],b[nmax],l,p;
int n,c,t[nmax];

int main()
{
    int i,j,k;
    freopen("shop.in","r",stdin);
    freopen("shop.out","w",stdout);
    scanf("%d %d %lld",&n,&c,&l);
    for (i=1;i<=n;i++) {
        scanf("%d %d",&j,&k);
        a[j]=k;
        t[i]=j;
    }
    k=0;
    while (l) {
        b[k++]=l%c;
        l/=c;
    }
    for (i=32;i>=1;i--) {
        if (b[i]>a[i]) {
            b[i-1]+=(b[i]-a[i])*c;
            b[i]=a[i];
        }
        p+=b[i];
    }
    p+=b[0];
    printf("%lld\n",p);

    for (i=1;i<=n;i++)
        printf("%d ",b[t[i]]);

    return 0;
}