#include<bits/stdc++.h>
using namespace std;
long long n,c,l,x2,y2,k[5500],a[5500],dx,dif,sol;
long long x[5500];
int main()
{
    freopen("shop.in","r",stdin);
    freopen("shop.out","w",stdout);
    scanf("%lld%lld%lld",&n,&c,&l);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld%lld",&x2,&y2);
        k[x2]=y2;
        a[i]=x2;
    }
    //sort(a+1,a+n+1);
    while(l)
    {
        x[++dx]=l%(1LL*c);
        l/=(1LL*c);
    }
    for(int i=dx;i>=1;i--)
    {
        if(x[i]>k[i-1])
        {
            dif=x[i]-k[i-1];
            x[i-1]+=(c*dif);
            x[i]=k[i-1];
        }
    }
    for(int i=1;i<=n;i++)
    {
        sol+=x[a[i]+1];
    }
    printf("%lld\n",sol);
    for(int i=1;i<=n;i++)
        printf("%lld ",x[a[i]+1]);
    return 0;
}