难受

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

const int N = 2000, M = 1000;
int m, n, k, l, d;
int x[N+5], y[N+5], p[N+5], q[N+5];
vector <int> X, Y;
bool visX[M+5], visY[M+5];

int main() {
    cin >> m >> n >> k >> l >> d;
    for(int i = 1; i <= d; i++) {
		cin >> x[i] >> y[i] >> p[i] >> q[i];
			 if(x[i] == p[i]) Y.push_back(min(y[i], q[i]));
		else if(y[i] == q[i]) X.push_back(min(x[i], p[i]));
	}
	sort(X.begin(), X.end());
	sort(Y.begin(), Y.end());
	for(int v : X) {
		if(visX[v] == false) {
			visX[v] = true;
			cout << v << ' ';
		}
	}
	cout << endl;
	for(int v : Y) {
		if(visY[v] == false) {
			visY[v] = true;
			cout << v << ' ';
		}
	}
    
    return 0;
}