新做法如下：

#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

int m, n, k, l, d;
int xa, ya, xb, yb;
vector <int> xs, ys;

void inp() {
    scanf("%d%d%d%d%d", &m, &n, &k, &l, &d);

    while(d -- ) {
        scanf("%d%d%d%d", &xa, &ya, &xb, &yb);

        if(ya == yb)
            xs.push_back(min(xa, xb));
        else
            ys.push_back(min(ya, yb));
    }
}

void work() {
    unique(xs.begin(), xs.end());
    unique(ys.begin(), ys.end());

    for(int i = 0; i < k; i ++ )
        printf("%d ", xs[i]);
    puts("");
        
    for(int i = 0; i < l; i ++ )
        printf("%d ", ys[i]);
    puts("");
}

int main() {
    inp();
    work();

    return 0;
}