rt.

#include<algorithm>
#include<iostream>
using namespace std;
int read(){
	int s=0,f=0;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-') f=1;
		c=getchar();
	}
	while(c<='9'&&c>='0'){
		s=s*((1<<3)+(1<<1))+c-'0';
		c=getchar();
	}
	return (f)?(-s):(s);
}
int minn(int x,int y){
	int a=x,b=y;
	return ((a<b)?(a):(b));
}
int M,N,K,L,D,x,y,p,q,a[1005],b[1005],c[1005],d[1005],tmp,rl,cl;
int main(){
	M=read(),N=read(),K=read(),L=read(),D=read();
	while(D--){
		x=read(),y=read(),p=read(),q=read();
		if(x==p) tmp=minn(y,q),++a[tmp],++b[tmp];
		else tmp=minn(x,p),++c[tmp],++d[tmp];
	}
	sort(a,a+M),sort(c,c+N);
	rl=a[M-K],cl=c[N-L];
	for(int i=1;i<=M;++i){
		if(b[i]>=rl) cout<<i<<' ';
	}
	putchar('\n');
    for(int i=1;i<=N;++i){
    	if(d[i]>=cl) cout<<i<<' ';
	}
	return 0;
}