#include <bits/stdc++.h>
using namespace std;
int m;//行
int n;//列
int k;//横向的路
int l;//纵向的路
int d;//讲话同学对数
struct h{
	int g;
	int hao;
}hang[1005];
h lie[1005];
int xa,ya,xb,yb;
bool cmp(h a,h b){
	return a.g > b.g;
}
bool cmmp(h a,h b){
	return a.hao < b.hao;
}
int main(){
	cin >> m >> n >> k >> l >> d;
	for(int i = 1;i<=d;i++){
		cin >> xa >> ya >> xb >> yb;
		if(xa == xb){
			hang[min(ya,yb)].g++;
		}else if(ya == yb){
			lie[min(xa,xb)].g++;
		}
	}
	for(int i = 1;i<=n-1;i++){
		hang[i].hao = i;
	}
	for(int i = 1;i<=m-1;i++){
		lie[i].hao = i;
	}
	sort(hang+1,hang+n,cmp);
	sort(lie+1,lie+m,cmp);
	sort(hang+1,hang+l,cmmp);
	sort(lie+1,lie+k,cmmp);
	for(int i = 1;i<=k;i++){
		cout << lie[i].hao << " ";
	}
	cout << endl;
	for(int i = 1;i<=l;i++){
		cout << hang[i].hao << " ";
	}
}