#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("shop.in");
ofstream g("shop.out");
unsigned long long L,D;
int c,n,i,j,poz[35],sol[35],nr;
struct gogu
{
    int x,y;
}a[35];
bool comp(gogu a,gogu b)
{
    return a.x<b.x;
}
int main()
{
    f>>n>>c>>L;
    for(i=1;i<=n;i++){
        f>>a[i].x>>a[i].y;
        poz[a[i].x]=i;
    }
    D=1;
    int re;
    sort(a+1,a+n+1,comp);
    for(i=n;i>=1;i--)
    {
        D=1;
        re=a[i].x;
        while(re!=0)
        {
            D=D*c;
            re--;
        }
        for(j=1;j<=a[i].y;j++)
        {
            if(D<=L)
            {
                L=L-D;
                sol[poz[a[i].x]]++;
                nr++;
            }
            else
                break;
        }
    }
    g<<nr<<"\n";
    for(i=1;i<=n;i++)
        g<<sol[i]<<' ';
}