#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("shop.in");
ofstream fout ("shop.out");
struct art { int a, b, c; };
int N, C, L, s, Sol[40];
art V[40];

bool cmp(art x, art y)
{
    return (x.a < y.a);
}

int Lg_Put(int nr, int p)
{
    int val = 1;
    while (p)
    {
        if (p & 1) val = val * nr;
        nr = nr * nr;
        p = (p >> 1);
    }
    return val;
}

int main()
{
    fin >> N >> C >> L;
    for (int i=1; i<=N; i++)
    {
        fin >> V[i].a >> V[i].b;
        V[i].c = i;
    }
    sort (V + 1, V + 1 + N, cmp);

    int l = 0, nr = N;
    while (l < L)
    {
        int p = V[nr].b;
        while (l + Lg_Put(C, V[nr].a) * p > L)
        {
            p--;
        }
        l += Lg_Put(C, V[nr].a) * p;
        Sol[V[nr].c] = p;
        s += p;
        nr--;
    }

    fout << s << '\n';
    for (int i=1; i<=N; i++) fout << Sol[i] << ' ';
    fout.close();
    return 0;
}