#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int dx[4]={0,0,1,-1}, dy[4]={-1,1,0,0};

void solve() {
    int n, m, k, hx, hy;
    cin >> n >> m >> k >> hx >> hy;
    int b[n][m];
    memset(b, 0, n*m*sizeof(int));
    b[--hx][--hy] = --k;
    while (k) {
        int x, y;
        cin >> x >> y;
        b[--x][--y] = --k;
    }
    char grid[n][m];
    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) cin >> grid[i][j];

    for (int ix = 0; ix < n; ix++) {
    }

    // solve
    vector<array<int, 2>> v[n*m];
    int f[n][m]; // distance array
    memset(f, -1, n*m*sizeof(int));
    ll ans;
    v[f[hx][hy] = 0].push_back({hx, hy});
    for (int d = 0; d < n*m; d++) {
        for (auto &[x, y]: v[d]) {
            ans += (ll)d*d;
            for (int i: {0, 1, 2, 3}) {
                int nx = x+dx[i], ny = y+dy[i];
                if (nx < 0 || ny < 0 || nx>=n || ny>=m || grid[nx][ny] == '#' || f[nx][ny] != -1) continue;
                v[f[nx][ny] = max(b[nx][ny],d)+1].push_back({nx, ny});
            }
        }
    }

    // ans
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    solve();
}