#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
int x[N], y[N], c[N], dd[N];
int main() {
	int m, n, k, l, d;
	cin >> m >> n >> k >> l >> d;
	for(int i = 1; i <= d; i ++) {
		int xi, yi, pi, qi;
		cin >> xi >> yi >> pi >> qi;
		if(xi == pi) x[min(yi, qi)] ++;
		if(yi == qi) y[min(xi, pi)] ++;
	}
	for(int i = 1; i <= k; i ++) {
		int mmax = INT_MIN, p;
		for(int j = 1; j < m; j ++)
			if(y[j] > mmax)
				mmax = max(mmax, y[j]), p = j;
		y[p] = 0, c[p] ++;
	}
	for(int i = 1; i <= l; i ++) {
		int mmax = INT_MIN, p;
		for(int j = 1; j <= n; j ++)
			if(x[j] > mmax)
				mmax = max(mmax, x[j]),	p = j;
		x[p] = 0, dd[p] ++;
	}
	for(int i = 0; i < 1000; i ++) {
		if(c[i] != 0) cout << i << " ";
	}
	cout << endl;
	for(int i = 0; i < 1000; i ++) {
		if(dd[i] != 0) cout << i << " ";
	}
	cout << endl;
	return 0;
}