#include <bits/stdc++.h>

#define ll long long
#define lll __int128

using namespace std;

namespace IO
{
	void read() {}
	template <typename T1, typename ...T2>
	void read(T1 &n, T2 &...m)
	{
		T1 op = 1;
		char c;
		while (isdigit(c = getchar()) == false)
			if (c == '-') op = -1;
		n = c ^ 48;
		while (isdigit(c = getchar()))
			n = (n << 1) + (n << 3) + (c ^ 48);
		n *= op;
		return read(m...);
	}
}

using IO::read;

namespace Solve
{
	const int MaxN = 1e3, MaxM = 1e3;
	
	int vis[MaxN + 10][MaxM + 10];
	int dx[] = {0, 1, 0, -1};
	int dy[] = {1, 0, -1, 0};
	
	int sqr(int x)
	{
		return x * x;
	}
	
	void Sol()
	{
		int n, m, pr, sx, sy, k;
		read(n, m, pr, sx, sy, k);
		for (int i = 1; i <= k; ++i)
		{
			int x, y;
			read(x, y);
			for (int j = 0; j * j < pr; ++j)
			{
				int dst = sqrt(pr - j * j);
				if (dst * dst == pr - j * j)
					--dst;
//				printf("j = %d, dst = %d\n", j, dst);
				if (x - j > 0)
				{
//					printf("x - j = %d, y - dst = %d, y + dst + 1 = %d\n", x - j, y - dst, y + dst + 1);
					++vis[x - j][max(0, y - dst)];
					if (y + dst <= m)
						--vis[x - j][y + dst + 1];
				}
				
				if (x + j <= n && j != 0)
				{
//					printf("x + j = %d, y - dst = %d, y + dst + 1 = %d\n", x + j, y - dst, y + dst + 1);
					++vis[x + j][max(0, y - dst)];
					if (y + dst <= m)
						--vis[x + j][y + dst + 1];
				}
			}
//			printf("i = %d\n", i);
//			for (int i = 1; i <= n; ++i)
//				for (int j = 1; j <= m; ++j)
//					printf("%d%c", vis[i][j], " \n"[j == m]);
		}
		for (int i = 0; i <= n + 1; ++i)
			for (int j = 1; j <= m + 1; ++j)
				vis[i][j] += vis[i][j - 1];
//		printf("af\n");
//		for (int i = 1; i <= n; ++i)
//			for (int j = 1; j <= m; ++j)
//				printf("%d%c", vis[i][j], " \n"[j == m]);
		for (int i = 0; i <= n + 1; ++i)
			for (int j = 0; j <= m + 1; ++j)
				if (i * i < pr || j * j < pr || sqr(n - i + 1) < pr || sqr(m - j + 1) < pr)
					vis[i][j] = 27;
		queue<pair<int, int> > q;
		vis[sx][sy] = 27;
		q.emplace(sx, sy);
		int ans = 0;
		while (q.empty() == false)
		{
			int x = q.front().first, y = q.front().second;
			q.pop();
			++ans;
			for (int i = 0; i < 4; ++i)
			{
				int nx = dx[i] + x, ny = dy[i] + y;
				if (vis[nx][ny] == 0)
					vis[nx][ny] = 27, q.emplace(nx, ny);
			}
		}
		printf("%d\n", ans);
	}
}

using Solve::Sol;

int main()
{
	Sol();
	return 0;
}