#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = a; i <= (b); i++)
#define drep(i, a, b) for (int i = a; i >= (b); i--)
// abc <= ((a+b+c)/3)^3  所以 (N-2r)^2 * 4r <= N^3 / 27
const int maxn = 1005, dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
int vis[maxn][maxn], a[maxn][maxn], n, m, rr, r, sx, sy, k, X[maxn * 2], Y[maxn * 2], VIS[maxn][maxn], num;
int cal(int x1, int y1, int x2, int y2) {
	return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
bool chk(int x, int y) {
	if (!(x - r >= 0 && x + r <= n + 1 && y - r >= 0 && y + r <= m + 1))
		return 0;
	rep(i, 1, num) if (a[X[i]][Y[i]]) return 0;
	return 1;
}
void dfs(int x, int y) {
	rep(i, 0, 3) {
		int xx = x + dx[i], yy = y + dy[i];
		rep(j, 1, num) X[j] += dx[i], Y[j] += dy[i];
		if (chk(xx, yy) && !vis[xx][yy]) {
			vis[xx][yy] = 1;
			dfs(xx, yy);
		}
		rep(j, 1, num) X[j] -= dx[i], Y[j] -= dy[i];
	}
}
signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m >> rr >> sx >> sy >> k;
	r = ceil(sqrt(rr)) + 1e-14;
	rep(i, 1, n) {
		int lm = maxn, rm = -1;
		rep(j, 1, m) {
			if (cal(i, j, sx, sy) < rr) {
				lm = min(lm, j);
				rm = max(rm, j);
			}
		}
		if (lm < maxn)
			X[++num] = i, Y[num] = lm, VIS[i][lm] = 1;
		if (~rm && rm != lm)
			X[++num] = i, Y[num] = rm, VIS[i][rm] = 1;
	}
	rep(j, 1, m) {
		int lm = maxn, rm = -1;
		rep(i, 1, n) {
			if (cal(i, j, sx, sy) < rr) {
				lm = min(lm, i);
				rm = max(rm, i);
			}
		}
		if (lm < maxn && !VIS[lm][j])
			X[++num] = lm, Y[num] = j;
		if (~rm && rm != lm && !VIS[rm][j])
			X[++num] = rm, Y[num] = j;
	}
	rep(i, 1, k) {
		int x, y;
		cin >> x >> y;
		a[x][y] = 1;
	}
	vis[sx][sy] = 1;
	dfs(sx, sy);
	int cnt = 0;
	rep(i, 1, n) {
		rep(j, 1, m) {
			cnt += vis[i][j];
		}
	}
	cout << cnt;

	return 0;
}