#include<bits/stdc++.h>
using namespace std;
int m,n,k,l,d,a[1010]={0},cnt;
int x,y,p,q,cnt1[1010],cnt2[1010];
int main(){
	cin>>m>>n>>k>>l>>d;
	memset(cnt1,0,sizeof(cnt1));
	memset(cnt2,0,sizeof(cnt2));
	cnt1[0] = 2020,cnt2[0] = 2020;
	for(int i = 1;i<=d;i++){
		cin>>x>>y>>p>>q;
		if(x==p) {
			if(y<q) cnt1[y]++;
			else cnt1[q]++;
		}
		if(y==q) {
			if(x<p) cnt2[x]++;
			else cnt2[p]++;
		}
	}
	for(int i = 1;i<=m;i++){
		if(cnt2[i] != 0){
			if(cnt<k) a[++cnt] = i;
			else {
				int minn = 1;
				for(int j=1;j<=cnt;j++)	
					if(cnt2[a[minn]]>cnt2[a[j]]) minn = j;
				a[minn] = i;
			}
		}
	}
	sort(a+1,a+cnt+1);
	for(int i = 1;i<=cnt;i++) cout<<a[i]<<" ";
	cout<<endl;
	cnt = 0;
	memset(a,0,sizeof(a));
	for(int i = 1;i<=n;i++){
		if(cnt1[i] != 0){
			if(cnt<l) a[++cnt] = i;
			else {
				int minn = 0;
				for(int j=1;j<=cnt;j++)	
					if(cnt1[a[minn]]>cnt1[a[j]]) minn = j;
				if(minn != 0) a[minn] = i;
			}
		}
	}
	sort(a+1,a+cnt+1);
	for(int i = 1;i<=cnt;i++) cout<<a[i]<<" ";
	return 0;
}