#include <fstream>
#include <cmath>
#include <vector>
#include <iomanip>
#include <queue>
#include <cstring>
#include <algorithm>
#include <queue>
#include <unordered_set>
#include <set>
#include <map>
#include <stack>
using namespace std;

ifstream cin("shop.in");
ofstream cout("shop.out");

const int MAXN = 30;

struct Coin{
    long long index, a, b;
};

bool Compare(const Coin &a, const Coin &b) {
    return a.a > b.a;
}

Coin v[1 + MAXN];
long long answer[1 + MAXN];

int main() {
    long long n, l, c, total = 0;
    cin >> n >> c >> l;
    for (int i = 1; i <= n; i++) {
        v[i].index = i;
        cin >> v[i].a >> v[i].b;
    }
    sort(v + 1, v + n + 1, Compare);
    for (int i = 1; i <= n; i++) {
        long long power = 1;
        for (int j = 1; j <= v[i].a; j++)
            power *= c;
        answer[v[i].index] += min(v[i].b, l / power);
        l -= power * answer[v[i].index];
        total += answer[v[i].index];
    }
    cout << total << "\n";
    for (int i = 1; i <= n; i++)
        cout << answer[i] << " ";
    return 0;
}