#include <cstdio>
#include <algorithm>
#define MAXN (1 << 18)
#define x first
#define y second
using namespace std;

int n, m, k, s;

typedef pair<int, int> pii;
pii a[MAXN];


inline int cmp(const pii &a, const pii &b)
{
	if (a.x == b.x) return a.y > b.y;
	return a.x < b.x;
}

inline int cmp2(const pii &a, const pii &b)
{
	if (a.x == b.x) return a.y < b.y;
	return a.x > b.x;
}

inline int cmp3(const pii &a, const pii &b)
{
	if (a.x == b.x) return a.y > b.y;
	return a.x > b.x;
}


inline int solve()
{
	sort(a, a+k);

	for (int i=0; i < k; ++i)
	{
		int ok = 1;

		for (int j=0; j < i; ++j)
			if (a[j].x > a[i].x-s &&
			    a[j].x < a[i].x &&
			    a[j].y > a[i].y-s &&
			    a[j].y < a[i].y)
			    {
					ok = 0;
					break;
			    }

		if (ok)
		{
			if (a[i].x < s || a[i].y < s)
				continue;
			return 1;
		}
	}

	sort(a, a+k, cmp);
	for (int i=0; i < k; ++i)
	{
		int ok = 1;
		for (int j=0; j < i; ++j)
			if (a[j].x > a[i].x-s &&
			    a[j].x < a[i].x &&
			    a[j].y > a[i].y &&
			    a[j].y < a[i].y+s)
			    {
					ok = 0;
					break;
			    }

		if (ok)
		{
			if (a[i].x < s || a[i].y > m-s)
				continue;
			return 1;
		}
	}

	sort(a, a+k, cmp2);
	for (int i=0; i < k; ++i)
	{
		int ok = 1;
		for (int j=0; j < i; ++j)
			if (a[j].x > a[i].x &&
			    a[j].x < a[i].x+s &&
			    a[j].y < a[i].y &&
			    a[j].y > a[i].y-s)
			    {
					ok = 0;
					break;
			    }

		if (ok)
		{
			if (a[i].x > n-s || a[i].y < s)
				continue;
			return 1;
		}
	}

	sort(a, a+k, cmp3);
	for (int i=0; i < k; ++i)
	{
		int ok = 1;
		for (int j=0; j < i; ++j)
			if (a[j].x > a[i].x &&
			    a[j].x < a[i].x+s &&
			    a[j].y > a[i].y &&
			    a[j].y < a[i].y+s)
			    {
					ok = 0;
					break;
			    }

		if (ok)
		{
			if (a[i].x > n-s || a[i].y > m-s)
				continue;
			return 1;
		}
	}

	return 0;
}

inline void read()
{
	scanf("%d%d%d", &n, &m, &s);
	scanf("%d", &k);

	for (int i=0; i < k; ++i)
		scanf("%d%d", &a[i].x, &a[i].y);
}

int main()
{
	read();

	if (s == 1) printf("YES\n");
	else printf("%s\n", solve()?"YES":"NO");
	return 0;
}
