//Author: Piotr Zielinski
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

const int N = 2005;

vector<vector<char>> in(N, vector<char> (N, 'X'));
vector<vector<PII>> dist(N, vector<PII> (N, PII (-1, -1)));


void add(queue<PII> &q, int x, int y, PII d) {
    if(dist[x][y].first == -1 && in[x][y] != 'X') {
        q.push({x, y});
        dist[x][y] = d;
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int n, m, k;
    cin >> n >> m >> k;

    for(int i = 1;i <= n;++i) {
        for(int j = 1;j <= m;++j) {
            cin >> in[i][j];
        }
    }

    queue<PII> Q;
    Q.push({1, 1});
    dist[1][1] = {0, 0};

    while(!Q.empty()) {
        PII cur = Q.front();
        Q.pop();

        add(Q, cur.first + 1, cur.second, {dist[cur.first][cur.second].first + 1, dist[cur.first][cur.second].second});
        add(Q, cur.first - 1, cur.second, {dist[cur.first][cur.second].first, dist[cur.first][cur.second].second + 1});
        add(Q, cur.first, cur.second + 1, {dist[cur.first][cur.second].first + 1, dist[cur.first][cur.second].second});
        add(Q, cur.first, cur.second - 1, {dist[cur.first][cur.second].first, dist[cur.first][cur.second].second + 1});
    }

    // cout << dist[n][m].first << " " << dist[n][m].second << endl;

    LL a, b;
    LL res = 1e18, cRes = 0, tRes;

    while(k --> 0) {
        cin >> a >> b;
        tRes = a  * dist[n][m].first + b * dist[n][m].second;
        if(tRes < res) {
            res = tRes;
            cRes = 1;
        }
        else if(tRes == res)
            ++cRes;
    }

    cout << res << " " << cRes << "\n";

    return 0;
}