#include<bits/stdc++.h>
using namespace std;
long long m,n,k,l,d,x[100000],y[100000],p[100000],q[100000];
long long a[100000],b[100000],s1[100000],s2[100000],t1,t2,ta,tb;
int main()
{
	cin>>m>>n>>k>>l>>d;
	for(int i=1;i<=d;i++)cin>>x[i]>>y[i]>>p[i]>>q[i];
	for(int i=1;i<=d;i++)
	{
		if(x[i]==p[i])//一排 
		{
			t2++;
			s2[t2]=min(y[i],q[i]);
		}
		if(y[i]==q[i])//一列
		{
			t1++;
			s1[t1]=min(x[i],p[i]);
		}
	}
	sort(s1+1,s1+1+t1);
	sort(s2+1,s2+1+t2);
	for(int i=1;i<=t1;i++)
	{
		if(s1[i]!=s1[i-1])
		{
			ta++;
			a[ta]=s1[i];
		}
	}
	for(int i=1;i<=t2;i++)
	{
		if(s2[i]!=s2[i-1])
		{
			tb++;
			b[tb]=s2[i];
		}
	}
	for(int i=1;i<=k;i++)cout<<a[i]<<" ";
	cout<<endl;
	for(int i=1;i<=l;i++)cout<<b[i]<<" ";
	return 0;
}