感觉是做法假了/kk

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define pre(i,a,b) for(int i=(a);i>=(b);i--)
#define sq(x) x*x
//Code by *****
using namespace std;
int n,m,k,l,d;
int Map[1005][1005];
void init(){
    int tot=1;
    rep(i,1,d){
        int x,y;
        int a,b;
        cin>>x>>y>>a>>b;
        Map[x][y]=tot;
        Map[a][b]=tot;
        tot++;
    }
}
signed main(){
    cin>>n>>m>>k>>l>>d;
    init();
    bool flag=1;
    rep(i,1,n-1){
        rep(j,1,m){
            if(k<=0){
                flag=0;
                break;
            }
            if(Map[i][j]!=0&&Map[i+1][j]!=0&&Map[i][j]==Map[i+1][j]){
                cout<<i<<" ";
                k--;
                break;
            }
        }
        if(!flag) break;
    }
    cout<<endl;
    flag=1;
    rep(j,1,m-1){
        rep(i,1,n){
            if(l<=0){
                flag=0;
                break;
            }
            if(Map[i][j]!=0&&Map[i][j+1]!=0&&Map[i][j]==Map[i][j+1]){
                cout<<j<<" ";
                l--;
                break;
            }
        }
        if(!flag) break;
    }
    cout<<endl;
    return ~~(0^0);
}