#include <bits/stdc++.h>
using namespace std;

int n, c;
int f[35];
long long l;
struct moneda{
    int a, b, p;
    bool operator < (const moneda &aux)const{
        return a > aux.a;
    }
};
moneda v[35];
int main()
{
    freopen("shop.in", "r", stdin);
    freopen("shop.out", "w", stdout);

    scanf("%d%d%lld", &n, &c, &l);
    for(int i = 1; i <= n ; ++i)
        scanf("%d%d", &v[i].a, &v[i].b), v[i].p = i;
    sort(v + 1, v + n + 1);

    long long p = 1, k = 0;
    int Sol = 0;
    while(k < v[1].a) p = p * c, ++k;
    for(int i = 1; i <= n ; ++i){
        while(k > v[i].a) --k, p = p / c;
        int d = l / p;
        if(d > v[i].b){
            l = l - 1LL * v[i].b * p;
            f[v[i].p] = v[i].b;
            Sol += v[i].b;
        }
        else{
            l = l - 1LL * d * p;
            f[v[i].p] = d;
            Sol += d;
        }
    }

    printf("%d\n", Sol);
    for(int i = 1; i <= n ; ++i)
        printf("%d ", f[i]);

    return 0;
}