RT，轻点喷

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1010;
int m, n, k, l, d, cnt;
struct pos {
    int x, y, p, q;
} a[N];
struct node {
    int id, val;
    bool operator <(const node &x) const {
        return val > x.val;
    }
} c[N], r[N];

inline bool cmp(const node &x, const node &y) {
    return x.id < y.id;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> m >> n >> k >> l >> d;
    for (int i = 1; i <= d; ++i) {
        cin >> a[i].x >> a[i].y >> a[i].p >> a[i].q;
        if (a[i].x == a[i].p)
            c[min(a[i].y, a[i].q)].id = min(a[i].y, a[i].q), ++c[min(a[i].y, a[i].q)].val;
        if (a[i].y == a[i].q)
            r[min(a[i].x, a[i].p)].id = min(a[i].x, a[i].p), ++r[min(a[i].x, a[i].p)].val;
    } sort(c + 1, c + n + 1), sort(r + 1, r + m + 1);
    sort(c + 1, c + l + 1, cmp), sort(r + 1, r + k + 1, cmp);
    for (int i = 1; i <= k; ++i) cout << r[i].id << " \n"[i == k];
    for (int i = 1; i <= l; ++i) cout << c[i].id << " \n"[i == l];
    return 0;
}