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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include "bits/stdc++.h"

using namespace std;
#define PB push_back
#define LL long long
#define int LL
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int,int>
#define LD long double

template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;
  cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream &os, vector<T> V){
  os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]";
} 

template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}


#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
struct Solution{
    int n,m,k;
    vector<string> board;
    vector<PII> men;
    Solution(){
        cin >> n >> m >> k;
        board.resize(n);
        REP(i, n){
            cin >> board[i];
        }
        men.resize(k);
        REP(i, k){
            int a,b;
            cin >> a >> b;
            men[i] = {a,b};
        }
    }

    bool between(int mid, int l, int r){
        return mid >= l && mid <= r;
    }

    bool valid(PII p){ 
        return between(p.st, 0, n - 1) && between(p.nd, 0, m - 1);
    }
    vector<PII> neigh(PII p){ 
        const vector<PII> dir = {
            {0, 1},
            {1, 0},
            {-1, 0},
            {0, -1}
        };
        vector<PII> res;
        for(PII d : dir){
            int nx = d.st + p.st;
            int ny = d.nd + p.nd;
            if(valid({nx, ny}) && board[nx][ny] != 'X'){
                res.PB({nx, ny});
            }
        }
        return res;
    }

    int get_dist(){
        vector<vector<bool>> vis(n, vector<bool>(m));
        vector<PII> cur = {{0,0}};
        vis[0][0] = true;
        int dist = 0;
        while(!vis[n-1][m-1]){
            debug(cur);
            assert(!cur.empty());
            dist++;
            vector<PII> ncur;
            for(PII p: cur){
                for(PII np: neigh(p)){
                    if(!vis[np.st][np.nd]){
                        vis[np.st][np.nd] = true;
                        ncur.PB({np.st, np.nd});
                    }
                }
            }
            cur = ncur;
        }
        return dist;
    }

    PII solve(){
        int dist = get_dist(); 
        int up = n - 1 + m - 1;
        int down = 0;
        dist -= up + down;
        assert(dist % 2 == 0);
        up += dist / 2;
        down += dist / 2;
        debug(dist, up, down);
        map<int,int> res;
        for(PII p : men){
            debug(p.st, p.nd);
            res[p.st * up + p.nd * down]++;
        }
        return *res.begin();
    }
};
int n,m,k;

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
    PII ans = Solution().solve();
    cout << ans.st << " " << ans.nd << "\n";
}