#include<bits/stdc++.h>
using namespace std;
int m,n,k,l,d,t; 
int x[2005],y[2005],p[2005],q[2005];
struct tt
{
	int i,s;
}a[2005],b[2005];
bool cmp(tt aa,tt bb)
{
	return aa.s>bb.s;
}
bool cmp2(tt aa,tt bb)
{
	return aa.i>bb.i;
}
int main()
{
	cin>>m>>n>>k>>l>>d;
	for(int i=1;i<=d;i++)
	{
		cin>>x[i]>>y[i]>>p[i]>>q[i];
		if(x[i]==p[i])
		{
			t=y[i]>q[i]?q[i]:y[i];
			a[t].s++;
			a[t].i=t;
		}
		else
		{
			if(y[i]==q[i])
			{
				t=x[i]>p[i]?p[i]:x[i];
				b[t].s++;
				b[t].i=t;
			}
		}
	}
	sort(a+1,a+2000,cmp);
	sort(b+1,b+2000,cmp);
	sort(a+1,a+2000,cmp2);
	sort(b+1,b+2000,cmp2);
	for(int i=k;i>=1;i--)
	{
		printf("%d ",b[i].i);
	}
	printf("\n");
	for(int i=l;i>=1;i--)
	{
		printf("%d ",a[i].i);
	}
	return 0;
 }