#include <fstream>
#include <algorithm>

using namespace std;
pair<int, pair<int,int> > a[50];
long long  n,c,l,sum,power,nr[50],j,i;
int main()
{
    ifstream f("shop.in");
    ofstream g("shop.out");
    f>>n>>c>>l;
    for(i=1; i<=n; i++)
    {
        f>>a[i].first>>a[i].second.first;
        a[i].second.second=i;
    }
    sort(a+1,a+n+1);
    for(i=n; i>=1; i--)
    {
        power=1;
        for(j=1; j<=a[i].first; j++)
            power*=c;
        if(l/power<=a[i].second.first)
        {
            nr[a[i].second.second]=l/power;
            sum+=l/power;
            l%=power;
        }
        else
        {
            nr[a[i].second.second]=a[i].second.first;
            sum+=a[i].second.first;
            l=l-a[i].second.first*power;
        }
    }
    g<<sum<<"\n";
    for(i=1; i<=n; i++)
        g<<nr[i]<<" ";
    return 0;
}