#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

int N, M;

int P;
int S;

void scan(){
    scanf ( "%d%d%d%d", &N, &M, &S, &P );
}

int sum[1024][1024];

void solve1(){

    ++S;
    ++N;
    ++M;
    for ( int i = 0; i < P; ++i ){
        int x, y;

        scanf ( "%d%d", &x, &y );

        sum[++x][++y] = 1;
      //  cout << S   << " " << P << " " << x << " " << y << endl;
    }
 /*   for ( int i = 1; i <= N; ++i ){
        for ( int j = 1; j <= M; ++j )
            cout << sum[i][j] << " ";
        cout << endl;
    }
    cout << endl;*/

    for ( int i = 1; i <= N; ++i )
        for ( int j = 1; j <= M; ++j )
            sum[i][j] = sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1] + sum[i][j];
/*
    for ( int i = 1; i <= N; ++i ){
        for ( int j = 1; j <= M; ++j )
            cout << sum[i][j] << " ";
        cout << endl;
    }*/
    int k = 0;

    for ( int i = 1; i + S - 1 <= N ; ++i )
        for ( int j = 1; j + S - 1 <= M ; ++j )
            if ( sum[i + S - 2][j + S - 2] - sum[i + S - 2][j] - sum[i ][j + S - 2] + sum[i][j] == 0 ){
             //   cout << i << " " << j << endl;
                k = 1;
            }

    if ( k )
        printf ( "YES\n" );
    else
        printf ( "NO\n" );

}

vector < pair < int, int > > v;

void solve2(){
    for ( int i = 0; i < P; ++i ){
        int x, y;

        scanf ( "%d%d\n", &x, &y );

        v.push_back ( make_pair ( x, y ) );
    }

    v.push_back ( make_pair ( 0, 0 ) );
    v.push_back ( make_pair ( 0, M ) );
    v.push_back ( make_pair ( N, 0 ) );
    v.push_back ( make_pair ( 0, M ) );
    int k = 0;

    for ( int i = 0; i < v.size(); ++i ){
        int mx = 0, mn = N;
        if ( v[i].second + S > M ) continue;

        for ( int j = 0; j < v.size(); ++j )
            if ( i != j && v[j].second > v[i].second && v[j].second < v[j].second + S )
                if ( v[i].first >= v[j].first )
                    mx = max ( mx, v[j].first );
                else
                    mn = min ( mn, v[j].first );

       // cout << v[i].first << " " << v[i].second << " " << mx << " " << mn << endl;
        if ( mn - mx - 1 >= S - 2 ) k = 1;
    }

    if ( k )
        printf ( "YES\n" );
    else
        printf ( "NO\n" );
}
int main(){
    scan();
    if ( N <= 1001 && M <= 1001 )
        solve1();
    else
        solve2();

}
