#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

char maze[20][20];
bool mark[20][20];
int n, m, k;
int tunnel[400][4];
double ans;
int throwx, throwy;
int startx, starty;

int isValid(int x, int y)  {
    if(x>=0 && x<n && y>=0 && y<m && maze[x][y]!='#' && !mark[x][y]) return 1;
    return 0;
}

bool findThrow(int x, int y)    {
    for(int i = 0; i < k; i++)  {
        if(tunnel[i][0]==x && tunnel[i][1]==y)  {
            throwx = tunnel[i][2];
            throwy = tunnel[i][3];
            return true;
        }
    }
    return false;
}

double findProbability(int x, int y, double ans) {
    if(isValid(x,y)==0)   return 0;
    mark[x][y]=true;
    if(maze[x][y]=='%') return ans;
    if(maze[x][y]=='*') return 0;
    if(findThrow(x,y))  return findProbability(throwx,throwy,ans);
    int n = isValid(x-1,y) + isValid(x+1,y) + isValid(x,y-1) + isValid(x,y+1);
    double a[4];
    a[0] = findProbability(x-1,y,ans/n);
    a[1] = findProbability(x+1,y,ans/n);
    a[2] = findProbability(x,y-1,ans/n);
    a[3] = findProbability(x,y+1,ans/n);
    return *max_element(a,a+4);
}

int main() {
    cin>>n>>m>>k;
    for(int i = 0; i < n; i++)  {
        for(int j = 0; j < m; j++)  {
            cin>>maze[i][j];
            mark[i][j]=false;
            if(maze[i][j]=='A') {
                startx=i;
                starty=j;
            }
        }
    }
    for(int i = 0; i < k; i++)  {
        cin>>tunnel[i][0]>>tunnel[i][1]>>tunnel[i][2]>>tunnel[i][3];
        tunnel[i][0]--;
        tunnel[i][1]--;
        tunnel[i][2]--;
        tunnel[i][3]--;
    }
    cout<<findProbability(startx,starty,1);
    return 0;
}