#include <bits/stdc++.h>
using i64 = long long;

const int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1};
#define pii std::pair<int, int>
#define ppi std::pair<pii, pii>
#define x first
#define y second

int dis(pii a, pii b) {
    auto x = a.x - b.x, y = a.y - b.y;
    return x * x + y * y;
}
bool vis[2000][2000]; 
signed main() {
    std::ios_base::sync_with_stdio(0), std::cin.tie(0);

    int n, m;
    std::cin >> n >> m;

    auto ok = [&](int x, int y) {
        return 0 <= x and x <= n + 1 and 0 <= y and y <= m + 1;
    };

    int r2;
    std::cin >> r2;

    int sx, sy, k;
    std::cin >> sx >> sy >> k;

//    std::vector vis(n + 2, std::vector<bool>(m + 2, false));

    std::queue<ppi> q;

    for (int i = 1; i <= n; i++)
        for (int j : {0, m + 1})
            q.push({{i, j}, {i, j}});
    for (int i : {0, n + 1})
        for (int j = 1; j <= m; j++)
            q.push({{i, j}, {i, j}});
    q.push({{0, 0}, {0, 0}});
    q.push({{0, m + 1}, {0, m + 1}});
    q.push({{n + 1, 0}, {n + 1, 0}});
    q.push({{n + 1, m + 1}, {n + 1, m + 1}});
    for (int x, y, i = 1; i <= k; i++) {
        std::cin >> x >> y;
        q.push({{x, y}, {x, y}});
    }

    // bfs the vis
    while (!q.empty()) {
        auto [cen, p] = q.front();

        q.pop();

        if (ok(p.x, p.y))
            vis[p.x][p.y] = true;

        for (int k = 0; k < 8; k++) {

            int X = p.x + dx[k], Y = p.y + dy[k];
            if (ok(X, Y) and vis[X][Y] == false and dis(cen, {X, Y}) < r2) {
                vis[X][Y] = true;
                q.push({cen, {X, Y}});
            }
        }
    }

    // for (int i = 1; i <= n; i++) {
    //     for (int j = 1; j <= m; j++)
    //         std::cerr << (vis[i][j] ? '#' : '.');
    //     std::cerr << '\n';
    // }

    int ans = 0;
    std::queue<pii> Q;
    Q.push({sx, sy});
    vis[sx][sy] = true;
    // bfs the ans
    while (!Q.empty()) {

        auto [x, y] = Q.front();
        Q.pop();
        ans++;

        for (int k = 0; k < 8; k++) {
            int X = x + dx[k], Y = y + dy[k];
            if (ok(X, Y) and vis[X][Y] == false) {
                vis[X][Y] = true;
                Q.push({X, Y});
            }
        }
    }
    std::cout << ans;
}