// while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC target ("avx2")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
// #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <cmath>
// #include <functional>
// #include <fstream>
#include <vector>
// #include <algorithm>
// #include <string>
// #include <set>
// #include <map>
// #include <list>
// #include <time.h>
// #include <math.h>
// #include <random>
// #include <deque>
// #include <queue>
// #include <cassert>
// #include <unordered_map>
// #include <unordered_set>
// #include <iomanip>
// #include <bitset>
// #include <sstream>
// #include <chrono>
// #include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef long double ld;
const string TASK_NAME = "shop";
#define files(TASK_NAME) read(TASK_NAME); write(TASK_NAME)
#define read(TASK_NAME) freopen((TASK_NAME + ".in").c_str(), "r", stdin)
#define write(TASK_NAME) freopen((TASK_NAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int) (c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228

bool HOME = 1;
int n, c;
ll w;

struct T {
  ll a, b;
  int i;
};

bool operator < (T f, T s) {
  return f.a > s.a;
}

int main() {
#ifdef INFOARENA
    HOME = 0;
#endif
  if (HOME) {
    freopen ("input", "r", stdin);
  } else {
    files(TASK_NAME);
  }
  cin >> n >> c >> w;
  vector<T> v;
  vector<int> take(n, 0);
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    ll x = 1;
    for (int i = 1; i <= a; i++) {
      x *= (ll) c;
    }
    v.push_back({x, b, i});
  }
  sort(v.begin(), v.end());
  for (auto &it : v) {
    take[it.i] = min(it.b, w / it.a);
    w -= it.a * take[it.i];
  }
  ll su = 0;
  for (auto &it : take) {
    su += it;
  }
  cout << su << "\n";
  for (auto &it : take) {
    cout << it << " ";
  }
  cout << "\n";
  return 0;
}