#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;

template<typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T> >;

static const int INTINF = (2147483647 >> 1); // 10^9 + 5000
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 1e5+1;
static const ll MOD = 1e9+7;

namespace Kunitaka{
    template<
        typename TYPE,
        std::size_t SIZE
    >
    std::size_t array_length(const TYPE (&array)[SIZE])
    {
        return SIZE;
    }

    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
}
using namespace Kunitaka;
namespace Printer{
    void br(){
        cout << endl;
    }

    void loop_cnt(int i){
        cout << "i = " << i << endl;
    }

    void loop_cnt(int i, int j){
        cout << "i = " << i << ", " << "j = " << j << endl;
    }

    template<class T>
    void print(T x){
        cout << x << endl;
    }

    template<class T, class S>
    void print(T x, S y){
        cout << x << "," << y << endl;
    }

    template<class T, class S, class U>
    void print(T x, S y, U z){
        cout << x << "," << y << "," << z << endl;
    }

    template<class T, class S>
    void print(pair<T, S> p){
        cout << p.first << ", " << p.second << endl;
    }

    template<
        typename TYPE,
        std::size_t SIZE
    >
    void print(const TYPE (&array)[SIZE]){
        int lim = array_length(array);
        for(int i=0; i<lim; i++){
            if(i) cout << " ";
            cout << array[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<S> v){
        for(int i=0; i<v.size(); i++){
            if(i) cout << " ";
            cout<< v[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<vector<S> > vv){
        for(int i=0; i<vv.size(); i++){
            for(int j=0; j<vv[i].size(); j++){
                if(j) cout << " ";
                cout << vv[i][j];
            }
            cout << endl;
        }
    }

    void yesno(bool x){
        if(x) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
};
using namespace Printer;

struct Area{
    ll w, h;
};

ll calc(Area area){
    return area.w * area.h;
}

int main(int argc, const char * argv[]) {
    //提出時、消す----//
    //--------------//


    // input
    cout << fixed << setprecision(10);
    while(1){
        ll N, W, D; cin >> N >> W >> D;
        if(!N && !W && !D) break;
        Area area = {W, D};

        vector<Area> areas;
        areas.push_back(area);
        for(int i=0; i<N; i++){
            int p, s; cin >> p >> s;
            p--;
            Area area1 = areas[p];
            ll gaisyuu = area1.w * 2 + area1.h * 2;
            s %= gaisyuu;
            if(s > gaisyuu / 2) s -= gaisyuu / 2;

            int type = 0;
            if(s > area1.w){
                type = 1;
                s -= area1.w;
            }
            Area area2 = {0, 0};
            Area area3 = {0, 0};
            if(!type){
                area2 = {s, area1.h};
                area3 = {area1.w-s, area1.h};
            }
            else{
                area2 = {area1.w, s};
                area3 = {area1.w, area1.h - s};
            }

            
            areas.erase(areas.begin() + p);
            if(calc(area2) < calc(area3)){
                areas.push_back(area2);
                areas.push_back(area3);
            }
            else{
                areas.push_back(area3);
                areas.push_back(area2);
            }
        }

        vector<ll> res;
        for(int i=0; i<N+1; i++){
            res.push_back(calc(areas[i]));
        }
        sort(res.begin(), res.end());
        for(int i=0; i<N+1; i++){
            if(i) cout << " ";
            cout << res[i];
        }
        cout << endl;
    }
    
    
    return 0;
}



Measured memory_bytes: 3028