#include <bits/stdc++.h>
using namespace std;
int n,m,k,l,d;
struct lei{
	int x,n;
}b[1010];
struct hang{
	int x,n;
}c[1010];
bool cmp(lei A,lei B){
	return A.n>B.n;
}
bool cmp1(hang A,hang B){
	return A.n>B.n;
}
int main(){
	cin>>n>>m>>k>>l>>d;
	for(int i=1;i<=d;i++){
		int x,y,xx,yy;
		cin>>x>>y>>xx>>yy;
		if(x==xx)b[x+1].n++;
		if(y==yy)c[n+1-y].n++;
	}
	for(int i=1;i<m;i++)b[i].x=i+1;
	for(int i=n;i>=1;i--)c[i].x=n-i;
	sort(b+1,b+1+n,cmp);
	sort(c+1,c+1+n,cmp1);
	for(int i=1;i<=k;i++)cout<<c[i].x<<" ";
	cout<<endl;
	for(int i=1;i<=l;i++)cout<<b[i].x<<" ";
}