题目：这里

代码：

#include <bits/stdc++.h>
using namespace std;
struct node{
    int n, m;
}k[1005], l[1005];
bool cmp(node x, node y){
    return x.n > y.n;
}
bool cmp1(node x, node y){
    return x.m < y.m;
}
int d, n, m, q, p, x1, x2, y1, y2;
int main(){
    cin >> m >> n >> q >> p >> d;
    for(int i = 1; i <= d; i ++){
        cin >> x1 >> y1 >> x2 >> y2;
        if(x1 == x2){
	        l[min(y1, y2)].m = min(y1, y2);
	        l[min(y1, y2)].n ++;
        }
        else{
	        k[min(x1, x2)].m = min(x1, x2);
	        k[min(x1, x2)].n ++;
        }
    }
    sort(l + 1, l + n + 1, cmp);
    sort(k + 1, k + m + 1, cmp);
    sort(l + 1, l + p + 1, cmp1);
    sort(k + 1, k + q + 1, cmp1);
    for(int i = 1; i <= q; i ++) cout << k[i].m << " ";
    cout << "\n";
    for(int i = 1; i <= p; i ++) cout << l[i].m << " ";
    return 0;
}