#include <bits/stdc++.h>
#define int long long
using namespace std;
struct node{
	int x,y,p,q;
	char hs;
}a[10000005];
int p1[1000005],p2[1000005],cnt1,cnt2;
signed main()
{
	int M,N,K,L,D;
	cin >> M >> N >> K >> L >> D;
	for(int i = 1;i <= D;i ++){
		cin >> a[i].x >> a[i].y >> a[i].p >> a[i].q;
		/*if(a[i].x == a[i].p)
		{
			a[i].hs = 'h';
		}
		else{
			a[i].hs = 's';
		}*/
	}
	cnt1 = cnt2 = 1;
	for(int i = 1;i <= D;i++)
	{
		if(a[i].x == a[i].p)
		{
			p1[cnt1] = min(a[i].q,a[i].y);
			cnt1++;
		}
		else
		{
			p2[cnt2] = min(a[i].x,a[i].p);
			cnt2++;
		}
	}
	sort(p1 + 1,p1 + cnt1);
	sort(p2 + 1,p2 + cnt2);
	for(int i = 1;i <= K;i++)
	{
		cout << p2[i] <<" ";
	}
	cout << endl;
	for(int i = 1;i <= L;i++)
	{
		cout << p1[i] <<" ";
	}
}