#include <cstdio>

int abs (int x) { return x > 0 ? x : -x; }

int n, w, h, s;
namespace solve1
{
	int x[2048], y[2048];
	
	void solve ()
	{
		for (int i = 0; i < n; ++i) scanf ("%d%d", x + i, y + i);

		for (int i = 0; i < n; ++i)
		{
			int ins1 = 0, ins2 = 0, ins3 = 0, ins4 = 0;
			int h1 = -1, h2 = -1, h3 = -1, h4 = -1, v1 = -1, v2 = -1, v3 = -1, v4 = -1;
			for (int j = 0; j < n; ++j) if (abs(x[i] - x[j]) < s && abs (y[i] - y[j]) < s)
			{
				if (x[j] < x[i] && y[j] > y[i])
				{
					ins1 = 1;
					if (v1 == -1 || x[j] > x[v1]) v1 = j;
					if (h1 == -1 || y[j] < y[h1]) h1 = j;
				}
				if (x[j] < x[i] && y[j] < y[i])
				{
					ins3 = 1;
					if (v3 == -1 || x[j] > x[v3]) v3 = j;
					if (h3 == -1 || y[j] > y[h3]) h3 = j;
				}
				if (x[j] > x[i] && y[j] > y[i])
				{
					ins2 = 1;
					if (v2 == -1 || x[j] < x[v2]) v2 = j;
					if (h2 == -1 || y[j] < y[h2]) h2 = j;
				}
				if (x[j] > x[i] && y[j] < y[i])
				{
					ins4 = 1;
					if (v4 == -1 || x[j] < x[v4]) v4 = j;
					if (h4 == -1 || y[j] > y[v4]) v4 = j;
				}
				if (x[j] == x[i])
				{
					if (y[j] > y[i]) v1 = j;
					if (y[j] < y[i]) v3 = j;
				}
				if (y[j] == y[i])
				{
					if (x[j] > x[i]) h1 = j;
					if (x[j] < x[i]) h2 = j;
				}
			}
			if (!ins1 && x[i] >= s && y[i] <= h - s) { printf ("YES\n"); return; }
			if (!ins2 && x[i] <= w - s && y[i] <= h - s) { printf ("YES\n"); return; }
			if (!ins3 && x[i] >= s && y[i] >= s) { printf ("YES\n"); return; }
			if (!ins4 && x[i] <= w - s && y[i] >= s) { printf ("YES\n"); return; }
			if (x[v2] - x[v1] >= s || x[v4] - x[v3] >= s) { printf ("YES\n"); return; }
			if (y[h1] - y[h3] >= s || y[h2] - y[h4] >= s) { printf ("YES\n"); return; }
		}
		printf ("NO\n");
	}
};


int main ()
{
	scanf ("%d%d%d", &w, &h, &s);
	scanf ("%d", &n);
	solve1 :: solve ();
	return 0;
}

