// #define DEBUGGING
#include <bits/stdc++.h>
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
using ll = std::int64_t;
using ull = std::uint64_t;
using PLL = std::pair<ll, ll>;
using TLL = std::tuple<ll, ll, ll>;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }
#define mv_rec make_v(init, tail...)
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); }
#undef mv_rec
using namespace std;

#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

ll calc_s(ll h, ll w) { return h * w; }

ll calc_s(PLL p) {
    ll h, w;
    tie(h, w) = p;
    return calc_s(h, w);
}

pair<PLL, PLL> make_p(ll h1, ll w1, ll h2, ll w2) {
    if (calc_s(h2, w2) < calc_s(h1, w1)) {
        swap(h1, h2);
        swap(w1, w2);
    }
    return make_pair(PLL(h1, w1), PLL(h2, w2));
}

pair<PLL, PLL> cut(PLL p, ll len) {
    ll h, w;
    tie(h, w) = p;
    len %= 2 * (h + w);
    ll ch = 0, cw = 0;
    ll val;
    val = min(w, len);
    len -= val;
    cw += val;
    if (len == 0) return make_p(h, val, h, w - val);
    val = min(len, h);
    len -= val;
    ch += val;
    if (len == 0) return make_p(val, w, h - val, w);
    val = min(len, w);
    len -= val;
    cw -= val;
    if (len == 0) return make_p(h, val, h, w - val);
    return make_p(len, w, h - len, w);
}

bool solve() {
    ll n, w, d;
    cin >> n >> w >> d;
    if (!(n + w + d)) return false;
    
    V<PLL> cakes;
    cakes.emplace_back(d, w);
    
    while (n--) {
        ll p, s;
        cin >> p >> s;
        p--;
        PLL c = cakes[p];
        cakes.erase(cakes.begin() + p);
        PLL a, b;
        tie(a, b) = cut(c, s);
        cakes.push_back(a);
        cakes.push_back(b);
    }

    sort(ALL(cakes), [&](PLL a, PLL b) { return calc_s(a) < calc_s(b); });
    for (ll i = 0; i < cakes.size(); i++) cout << calc_s(cakes[i]) << " \n"[i + 1 == cakes.size()];
    return true;
}

int main() {
    while (solve());
    return 0;
}



Measured memory_bytes: 3104