#include 
#include 

using namespace std;
bool visited[1005][1005];
int main()
{
    int a,b;
    cin>>a>>b;
    int n;
    cin>>n;
    int s;
    cin>>s;
    int x,y;
    vector>v;
    for(int i=0;i>x>>y;
        x--;
        y--;
        v.push_back(make_pair(x,y));
        visited[x][y]=1;
    }
    queue>>Q;
    Q.push(v);
    int kolkuM=0;
    int kolkuZ=0;
    while(!Q.empty())
    {
        vector>p=Q.front();
        Q.pop();
        vector>p2;
        kolkuZ+=p.size();
        if(kolkuZ>=n)
        {
            cout<=0 && visited[ci-1][cj]==false)
            {
                p2.push_back(make_pair(ci-1,cj));
                visited[ci-1][cj]=1;
            }
            if(cj+1=0 && visited[ci][cj-1]==0)
            {
                p2.push_back(make_pair(ci,cj-1));
                visited[ci][cj-1]=1;
            }
        }
        Q.push(p2);
    }
    return 0;
}

/*
 ??XXX
 ?XXXX
 ??X??

 
 **/