#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

vector<pii> cut(pii hw, int s) {
  vector<pii> res;
  int h1, h2, w1, w2;
  s %= 2*hw.first + 2*hw.second;
  s = 2*hw.first + 2*hw.second - s;
  if (s < hw.first) {
    h1 = s;
    h2 = hw.first - h1;
    w1 = w2 = hw.second;
  }
  else if (s < hw.first + hw.second) {
    h1 = h2 = hw.first;
    w1 = s - hw.first;
    w2 = hw.second - w1;
  }
  else if (s < hw.first + hw.second + hw.first) {
    h1 = 2*hw.first + hw.second - s;
    h2 = hw.first - h1;
    w1 = w2 = hw.second;
  }
  else {
    w1 = 2*hw.first + 2*hw.second - s;
    w2 = hw.second - w1;
    h1 = h2 = hw.first;
  }
  if (h1*w1 >= h2*w2) {
    swap(h1, h2);
    swap(w1, w2);
  }
  res.push_back(pii(h1, w1));
  res.push_back(pii(h2, w2));
  return res;
}

int main() {
  while (true) {
    int n, w, d;
    cin >> n >> w >> d;
    if (n == 0 && w == 0 && d == 0) return 0;
    vector<pii> hw;
    hw.push_back(pii(d, w));
    rep (i, n) {
      int p, s;
      cin >> p >> s;
      p--;
      pii now = hw[p];
      hw.erase(hw.begin() + p);
      auto add = cut(now, s);
      //DEBUG_VEC(add);
      rep (i, 2) {
        hw.push_back(add[i]);
      }
    }

    vi s(hw.size());
    rep (i, hw.size()) s[i] = hw[i].first * hw[i].second;
    sort(all(s));
    rep (i, s.size()) {
      cout << s[i] << " \n"[i == s.size() - 1];
    }
  }
}



Measured memory_bytes: 3052