#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, MaxPr = 3e6;
	
	int vis[MaxN + 10][MaxM + 10], hs[MaxPr + 10];
	int dx[] = {0, 1, 0, -1};
	int dy[] = {1, 0, -1, 0};
	vector<pair<int, int> > chg;
	
	void Sol()
	{
		int n, m, pr, sx, sy, k;
		read(n, m, pr, sx, sy, k);
		double r = sqrt(pr);
		for (int o = 1; o <= k; ++o)
		{
			int x, y;
			read(x, y);
			for (int i = max(0, (int)ceil(1.0 * x - r + 1e-5)); i <= min(n + 1, (int)floor(1.0 * x + r - 1e-5)); ++i)
			{
				double dst = sqrt(pr - pow(i - x, 2));
				if (1.0 * y - floor(dst - 1e-5) >= 0)
					++vis[i][(int)(1.0 * y - floor(dst - 1e-5))];
				if (1.0 * y + ceil(dst - 1e-5) <= m + 1)
					--vis[i][(int)(1.0 * y + ceil(dst - 1e-5))];
			}
		}
		for (int i = 1; i <= n + 1; ++i)
			for (int j = 1; j <= m + 1; ++j)
				vis[i][j] += vis[i][j - 1];
		for (int i = 0; i <= n + 1; ++i)
			for (int j = 0; j <= m + 1; ++j)
				if (pow(n + 1 - i, 2) < pr || pow(m + 1 - j, 2) < pr || i * i < pr || j * j < pr)
					vis[i][j] = 120;
		int ans = 0;
		queue<pair<int, int> > q;
		q.emplace(sx, sy);
		vis[sx][sy] = 120;
		while (q.empty() == false)
		{
			++ans;
			int x = q.front().first, y = q.front().second;
			q.pop();
			for (int i = 0; i < 4; ++i)
			{
				int nx = dx[i] + x, ny = dy[i] + y;
				if (vis[nx][ny] == 0)
					q.emplace(nx, ny), vis[nx][ny] = 120;
			}
		}
		printf("%d\n", ans);
	}
}

using Solve::Sol;

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