#include <bits/stdc++.h>

using namespace std;

vector<vector<long double> > vec, aux;
vector<pair<pair<int,int>,pair<int,int> > > tuneles;
vector<string> maze;

void alCuadrado() {
    aux = vec;
    int n = vec.size();
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            vec[i][j] = 0;
        }
    }
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            for(int k=0;k<n;k++) {
                vec[i][j] += aux[i][k] * aux[k][j];
            }
        }
    }
    return;
}

pair<int,int> getDest(pair<int,int> p) {
    for(int i=0;i<tuneles.size();i++) {
        if(tuneles[i].first == p) {
            p = tuneles[i].second;
        } else if(tuneles[i].second == p) {
            p = tuneles[i].first;
        }
    }
    return p;
}

int main() {
    int n;
    int m;
    int k;
    cin >> n >> m >> k;
    int init = -1;
    vec.resize(n*m,vector<long double>(n*m,0.));
    maze.resize(n);
    for(int a0 = 0; a0 < n; a0++){
        cin >> maze[a0];
        for(int j=0;j<m;j++) {
            if(maze[a0][j] == 'A') {
                init = a0*m+j;
            }
        }
    }
    tuneles.clear();
    for(int a0 = 0; a0 < k; a0++){
        int i1;
        int j1;
        int i2;
        int j2;
        cin >> i1 >> j1 >> i2 >> j2;
        tuneles.push_back(make_pair(make_pair(i1-1,j1-1),make_pair(i2-1,j2-1)));
    }
    for(int i=0;i<n;i++) {
        for(int j=0;j<m;j++) {
            if(maze[i][j] == '%') {
                vec[i*m+j][i*m+j] = 1.;
            } else if(maze[i][j] == '.' || maze[i][j] == 'A') {
                vector<pair<int,int> > neighbours;
                if(i-1 >= 0 && maze[i-1][j] != '#') {
                    neighbours.push_back(make_pair(i-1,j));
                }
                if(i+1 < n && maze[i+1][j] != '#') {
                    neighbours.push_back(make_pair(i+1,j));
                }
                if(j-1 >= 0 && maze[i][j-1] != '#') {
                    neighbours.push_back(make_pair(i,j-1));
                }
                if(j+1 < m && maze[i][j+1] != '#') {
                    neighbours.push_back(make_pair(i,j+1));
                }
                long double p = 1./(long double)(neighbours.size());
                for(int ii=0;ii<neighbours.size();ii++) {
                    pair<int,int> dest = getDest(neighbours[ii]);
                    int d = dest.first*m+dest.second;
                    vec[i*m+j][d] = p;
                }
            } else if(maze[i][j] == '*') {
                vec[i*m+j][i*m+j] = 1.;
            }
        }
    }
    for(int i=0;i<20;i++) {
        alCuadrado();
    }
    long double res = 0;
    for(int i=0;i<n;i++) {
        for(int j=0;j<m;j++) {
            if(maze[i][j] == '%') {
                res += vec[init][i*m+j];
            }
        }
    }
    printf("%.7f\n",(double)res);
    return 0;
}