#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll M=2e3+5;
int m,n,k,l,d;
struct node {
	int s,r;
} a[M],b[M];
bool cmp(node a,node b) {
	return a.s > b.s;
}
bool cmp1(node a,node b) {
	return a.r < b.r;
}
int main() {
	cin>>m>>n>>k>>l>>d;
	for(ll i=1; i<=d; i++) {
		ll x,y,p,q;
		cin>>x>>y>>p>>q;
		ll u=min(x,p);
		ll v=min(y,q);
		if(y==q) {
			a[u].r=u;
			a[u].s++;
		} else {
			b[v].r=v;
			b[v].s++;
		}
	}
	sort(a+1,a+n+1,cmp);
	sort(b+1,b+m+1,cmp);
	sort(a+1,a+k+1,cmp1);
	sort(b+1,b+l+1,cmp1);
	for(int i=1; i<=k; i++) {
		cout<<a[i].r;
	}
	cout<<"\n";
	for(ll i=1; i<=l; i++) {
		cout<<b[i].r<<" ";
	}

	return 0;
}