/*input
3 6 1
###*OO
O#OA%O
###*OO
2 3 2 1
*/

#include<bits/stdc++.h>
using namespace std;
int n = 403;
double mat[405][405];
void gaussian_elimination()
{
    for(int i = 0; i<n; i++)
    {
        // cout << i << endl;
        int id = i;
        for(int j = i + 1; j<n; j++)
            if(fabs(mat[j][i]) > fabs(mat[id][i])) id = j;
        if(id != i)
            for(int j = i; j<=n; j++)
                swap(mat[id][j], mat[i][j]);
        if(mat[i][i]==0.0) continue;
        // for(int j = i + 1; j<=n; j++)
        //  mat[i][j] /= mat[i][i];
        // mat[i][i] = 1.0;
        for(int j = 0; j<n; j++)
        {
            if(j!=i){
                double factor = mat[j][i]/mat[i][i];
                for(int k = i + 1; k<=n; k++)
                    mat[j][k] -= factor * mat[i][k];
                mat[j][i] = 0.0;
            }
        }
 
    }
    // for(int i = 0; i<n; i++){
    //  for(int j = 0; j<=n; j++) {
    //      cout << mat[i][j] << " ";
    //  }
    //  cout << endl;
    // }
}
pair<int, int> tunel[40][40];
int fx[] = {0,0,1,-1};
int fy[] = {1,-1,0,0};
int N, m, k;
int isvali(int x, int y)
{
	return x < N && y<m && x>=0 && y>=0;
}
int main()
{
    scanf("%d %d %d", &N, &m, &k);
    char grid[N+1][m+5];
    for(int i = 0; i<N; i++)
    	scanf("%s", grid[i]);
    int start;
    for(int i = 0; i<k; i++)
    {
    	int a, b, x, y;
    	scanf(" %d %d %d %d", &a, &b, &x, &y);
    	tunel[a][b] = {x, y};
    	tunel[x][y] = {a, b};
    }
    for(int i = 0; i<N; i++)
    {
    	for(int j = 0; j<m; j++){
    		int node = (i) * m + j + 1;
    		if(grid[i][j]=='A') start = node;
    		if(grid[i][j] == '#') continue;
    		int cnt = 0;
    		for(int K = 0; K<4; K++)
    		{
    			int x = fx[K] + i;
    			int y = fy[K] + j;
    			if(isvali(x, y) && grid[x][y]!='#')
    				cnt++;
    		}
    		// cout << node << endl;
    		mat[node][node] = 1.0;
    		int to;
    		for(int K = 0; K<4; K++)
    		{
    			int x = fx[K] + i;
    			int y = fy[K] + j;
    			if(isvali(x, y) && grid[x][y]!='#')
    			{
    				auto pai = tunel[x+1][y+1];
    				if(pai!=make_pair(0, 0))
    				{
    					to = (pai.first-1) * m + pai.second;
    				}
    				else to = (x) * m + y + 1;
    				mat[node][to] = -1.0/cnt;
    				if(grid[i][j]=='%')
    					mat[node][to] = 0.0;
    				if(grid[i][j]=='*')
    					mat[node][to] = 0.0;
    			}
    		}

			if(grid[i][j]=='%')
				mat[node][n] = 1.0;
			if(grid[i][j]=='*')
				mat[node][n] = 0.0;

    	}
    }
    // for(int i = 1; i<n; i++){
    // 	cout << " hmm? " << i << " -> ";
    // 	for(int j = 1; j<=n; j++)
    // 		printf("%.02lf ", mat[i][j]);
    // 	cout << "  " << i << " <- hmm? ";
    // 	cout << endl;
    // }
    // cout << "gauss here" << endl << endl;

    gaussian_elimination();

    // for(int i = 1; i<n; i++){
    // 	for(int j = 1; j<=n; j++)
    // 		printf("%.02lf ", mat[i][j]);
    // 	cout << endl;
    // }
    printf("%.10lf\n", mat[start][n]/mat[start][start]);
	return 0;
}