代码如下

#include<bits/stdc++.h>
using namespace std;
int n,m,k,l,d;
struct alf{
	int n,t;
}a[1010],b[1010];
bool cmp(alf x,alf y){
	if(x.t!=y.t)
		return x.t>y.t;
	return x.n<y.n;
}
bool c2p(alf x,alf y){
	return x.n<y.n;
}
int main(){
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(a));
	scanf("%d%d%d%d%d",&n,&m,&k,&l,&d);
	int x1=0,x2=0,y1=0,y2=0;
	for(int i=1;i<=1010;i++)
		a[i].n=b[i].n=i;
	for(int i=1;i<=d;i++){
		cin>>x1>>y1>>x2>>y2;
		if(y1!=y2){
			b[min(y1,y2)].t++;
		}else{
			a[min(x1,x2)].t++;
		}
	}
	sort(a+1,a+n+1,cmp);
	sort(b+1,b+n+1,cmp);
	sort(a+1,a+k+1,c2p);
	sort(b+1,b+l+1,c2p);
	for(int i=1;i<=k;i++){
		cout<<a[i].n;
		if(i!=k)cout<<" ";
	}
	cout<<"\n";
	for(int i=1;i<=l;i++){
		cout<<b[i].n;
		if(i!=l)cout<<" ";
	}
	return 0;
}