#include <iostream>
#include <queue>

int main() {
    long long int n, m, k;
    std::cin >> n >> m >> k;
    std::queue<std::pair<int, int> > q;
    char map[n][m];
    long long int dist[n][m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            std::cin >> map[i][j];
            dist[i][j] = -1;
        }
    }

    dist[0][0] = 0LL;
    q.push(std::make_pair(0, 0));

    while (!q.empty()) {
        if (q.front().first < n - 1 && map[q.front().first + 1][q.front().second] != 'X' &&
            dist[q.front().first + 1][q.front().second] == -1) {
            dist[q.front().first + 1][q.front().second] = dist[q.front().first][q.front().second] + 1LL;
            q.push(std::make_pair(q.front().first + 1, q.front().second));
        }
        if (q.front().first > 0 && map[q.front().first - 1][q.front().second] != 'X' &&
            dist[q.front().first - 1][q.front().second] == -1) {
            dist[q.front().first - 1][q.front().second] = dist[q.front().first][q.front().second] + 1LL;
            q.push(std::make_pair(q.front().first - 1, q.front().second));
        }
        if (q.front().second < m - 1 && map[q.front().first][q.front().second + 1] != 'X' &&
            dist[q.front().first][q.front().second + 1] == -1) {
            dist[q.front().first][q.front().second + 1] = dist[q.front().first][q.front().second] + 1LL;
            q.push(std::make_pair(q.front().first, q.front().second + 1));
        }
        if (q.front().second > 0 && map[q.front().first][q.front().second - 1] != 'X' &&
            dist[q.front().first][q.front().second - 1] == -1) {
            dist[q.front().first][q.front().second - 1] = dist[q.front().first][q.front().second] + 1LL;
            q.push(std::make_pair(q.front().first, q.front().second - 1));
        }
        q.pop();
    }

    long long int min, num;
    min = 100000000000000000LL;
    num = 0;

    for (int i = 0; i < k; i++) {
        long long int a, b;
        std::cin >> a >> b;
        if (a * (n + m - 2LL + (dist[n - 1][m - 1] - n - m + 2LL) / 2LL) + b * ((dist[n - 1][m - 1] - n - m + 2LL) / 2LL) ==
            min) {
            num++;
        } else if (a * (n + m - 2LL + (dist[n - 1][m - 1] - n - m + 2LL) / 2LL) + b * ((dist[n - 1][m - 1] - n - m + 2LL) / 2LL) <
                   min) {
            min = a * (n + m - 2LL + (dist[n - 1][m - 1] - n - m + 2LL) / 2LL) + b * ((dist[n - 1][m - 1] - n - m + 2LL) / 2LL);
            num = 1;
        }
    }
    std::cout << min << " " << num;
    return 0;
}