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
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const ll INFTY=1e18;
const int MAX=2100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int n,m;
bool M[MAX][MAX];
int d[MAX][MAX];

int bfs() {
	loop(i,0,n) loop(j,0,m) d[i][j]=-1;
	d[0][0]=0;
	queue<PII> Q;
	Q.push({0,0});
	while(!Q.empty()) {
		auto v = Q.front();
		Q.pop();
		int i = v.ff;
		int j = v.ss;
		if(i-1>=0 && !M[i-1][j] && d[i-1][j] == -1) {
			d[i-1][j]=d[i][j]+1;
			Q.push({i-1, j});
		} 
		if(j-1>=0 && !M[i][j-1] && d[i][j-1] == -1) {
			d[i][j-1]=d[i][j]+1;
			Q.push({i, j-1});
		} 
		if(i+1<n && !M[i+1][j] && d[i+1][j] == -1) {
			d[i+1][j]=d[i][j]+1;
			Q.push({i+1, j});
		} 
		if(j+1<m && !M[i][j+1] && d[i][j+1] == -1) {
			d[i][j+1]=d[i][j]+1;
			Q.push({i, j+1});
		} 
	}
	return d[n-1][m-1];
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int k;
	cin>>n>>m>>k;
	char c;
	loop(i,0,n) {
		loop(j,0,m) {
			cin>>c;
			M[i][j]=(c=='X');
		}
	}
	int r = bfs();
	//pln(r);
	int diff=r-(n-1)-(m-1);
	ll A = n-1+m-1+diff/2;
	ll B = diff/2;
	//ps(A);pln(B);
	ll mini = INFTY;
	int ctr=0;
	ll a,b;
	while(k--) {
		cin>>a>>b;
		ll R = A*a+B*b;
		if(R<mini) {
			ctr=1;
			mini=R;
		} else if(R==mini) {
			ctr++;
		}
	}
	ps(mini);pln(ctr);
}