#include <fstream>
#include <algorithm>
using namespace std;

const int MAXN = 35;

ifstream fin("shop.in");
ofstream fout("shop.out");

int N, C;
int maxpower, Ans[MAXN];
long long L, P[MAXN], sum;
int Pos[MAXN];
struct Monezi
{
    int x;
    int y;
} V[MAXN];

inline bool cmp(Monezi a, Monezi b)
{
    return a.x > b.x;
}

void Precalculare()
{
    P[0] = 1;
    for (int i = 1; i <= maxpower; ++i)
        P[i] = 1LL * P[i - 1] * C;
}

int CautareBinara(int p, int l, int r)
{
    long long x = P[p];
    int best = -1;
    while (l <= r)
    {
        int m = (l + r) >> 1;
        long long val = 1LL * m * x;
        if (val == L) return m;
        else if (val < L)
        {
            best = max(best, m);
            l = m + 1;
        }
        else r = m - 1;
    }
    return best;
}

int main()
{
    fin >> N >> C >> L;
    for (int i = 1; i <= N; ++i)
    {
        fin >> V[i].x >> V[i].y;
        Pos[V[i].x] = i;
        maxpower = max(maxpower, V[i].x);
    }
    sort(V + 1, V + N + 1, cmp);
    Precalculare();
    for (int i = 1; i <= N && L > 0; ++i)
    {
        int nr = CautareBinara(V[i].x, 1, V[i].y);
        L -= nr * P[V[i].x];
        sum += nr;
        Ans[Pos[V[i].x]] += nr;
    }
    fout << sum << '\n';
    for (int i = 1; i <= N; ++i)
        fout << Ans[i] << " ";
    fin.close(); fout.close();
    return 0;
}