1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size()
#define RS resize

using VI = vector<int>;
using VVI = vector<VI>;
using PI = pair<int, int>;
using VPI = vector<PI>;
using VVPI = vector<VPI>;
using VL = vector<L>;
using VVL = vector<VL>;
using VB = vector<bool>;
using VC = vector<char>;

VVI g;
VL d;
VB vis;

void bfs(int start)
{
    queue<int> q;
    q.push(start);
    vis[start] = true;
    while (!q.empty())
    {
        int v = q.front();
        q.pop();
        for (int u : g[v])
            if (!vis[u])
            {
                vis[u] = true;
                d[u] = d[v] + 1;
                q.push(u);
            }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m, k;
    cin >> n >> m >> k;
    g.RS(n * m);
    d.RS(n * m);
    vis.RS(n * m);
    
    vector<VC> p(n, VC(m));
    REP(i, n)
        REP(j, m)
            cin >> p[i][j];
    
    REP(i, n)
        REP(j, m)
            if (p[i][j] == '.')
            {
                if (i > 0 && p[i - 1][j] == '.')
                    g[m * i + j].EB(m * (i - 1) + j);
                if (i < n - 1 && p[i + 1][j] == '.')
                    g[m * i + j].EB(m * (i + 1) + j);
                if (j > 0 && p[i][j - 1] == '.')
                    g[m * i + j].EB(m * i + j - 1);
                if (j < m - 1 && p[i][j + 1] == '.')
                    g[m * i + j].EB(m * i + j + 1);
            }
    
    VL a(k), b(k);
    REP(i, k)
        cin >> a[i] >> b[i];
    
    bfs(0);
    L od = d[n * m - 1];
    L m1 = (L)(n + m - 2);
    od -= m1;
    m1 += od / 2;
    L m2 = od / 2;
    
    L wyn = (L)1e18;
    int licz = 0;
    REP(i, k)
    {
        if (a[i] * m1 + b[i] * m2 == wyn)
            licz++;
        else if (a[i] * m1 + b[i] * m2 < wyn)
        {
            licz = 1;
            wyn = a[i] * m1 + b[i] * m2;
        }
    }
    cout << wyn << ' ' << licz;
}