#include <fstream>
#include <cmath>
#include <iostream>
using namespace std;

ifstream f("shop.in");
ofstream g("shop.out");

 long long n,c,l,aux;
 long long  val[31];
 long long  rez[31];
int poz[31];

int main()
{
        f >> n >> c >> l ;
        for (int i=1;i<=n;i++)
        {
                long long a,b;
                f >> a >> b;
                val[a] +=b;
                poz[i] = a;
        }

    int i = 30;
    long long mon = 0;

    while (l && (i > -1))
    {
            long long temp,put;
           put = max(( long long)1,( long long) pow(c,i));

           temp = min ( val[i] , l / ( long long)put);
           mon += temp;
           l -= ( long long)pow(c,i) * temp;
           rez[i] += temp;
        i--;
    }
         g << mon << "\n";
    for (int i=1;i<=n;i++)
        g << rez[ poz[i] ] << " ";

    return 0;
}