// ACM-ICPC国内予選2007 C. ケーキカット

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
	int n, w, d, p, s;
	while(cin >> n >> w >> d, w){
		vector < pair<int, int> > cake;
		cake.push_back(make_pair(w, d));
		for(int i=0;i<n;i++){
			cin >> p >> s;
			int nw = cake[p-1].first, nd = cake[p-1].second;
			for(int j=p-1;j<i;j++) cake[j] = cake[j+1];
			s %= (nw+nd);
			if(s < nw){
				cake[i] = make_pair(min(s, nw-s), nd);
				cake.push_back(make_pair(max(s, nw-s), nd));
			} else {
				s -= nw;
				cake[i] = make_pair(nw, min(s, nd-s));
				cake.push_back(make_pair(nw, max(s, nd-s)));
			}
		}
		vector <int> S;
		for(int i=0;i<n+1;i++) S.push_back(cake[i].first*cake[i].second);
		sort(S.begin(), S.end());
		for(int i=0;i<n;i++) cout << S[i] << " ";
		cout << S[n] << endl;
	}
}