#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,k,a1,a2,a3,a4;
struct hs{int z,p;}a[1010],b[1010];
bool bk1(hs w1,hs w2){return w1.z>w2.z;}
bool bk2(hs w1,hs w2){return w1.p<w2.p;}
int main(){
	freopen("seats.in","r",stdin);
	freopen("seats.out","w",stdout);    
    scanf("%d%d%d%d%d",&n,&m,&x,&y,&k);
    for(int i=1;i<=n;i++)a[i].p=i,a[i].z=0;
    for(int i=1;i<=m;i++)b[i].p=i,b[i].z=0;
    for(int i=1;i<=k;i++){
    	scanf("%d%d%d%d",&a1,&a2,&a3,&a4);
    	if(a1==a3)b[min(a2,a4)].z++;
    	else a[min(a1,a3)].z++;
    }
    sort(a+1,a+1+n,bk1);sort(a+1,a+1+x,bk2);
    sort(b+1,b+1+m,bk1);sort(b+1,b+1+y,bk2);
    for(int i=1;i<=x;i++)printf("%d ",a[i].p);printf("\n");
    for(int i=1;i<=y;i++)printf("%d ",b[i].p);
    return 0;
}