#include <bits/stdc++.h>
using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << ", ";
#define endln cerr << "\n";

typedef long double T;
#define EPS 1e-9
typedef vector<T> ROW;
typedef vector<ROW> MATRIX;

T MatrixDeterminant(MATRIX a, ROW& r) {
    int i, j, k, n = a.size(), m = a[0].size();
    T res = 1;
    for (i = 0; i < n; i++) {
        if (!sign(a[i][i])) {
            for (j = i + 1; j < n; j++) {
                if (sign(a[j][i])) {
                    for (k = 0; k < m; k++) a[i][k] += a[j][k];
                    break;
                }
            }
            if (j == n) continue;
        }
        T tmp = a[i][i];
        for (k = 0; k < m; k++) a[i][k] /= tmp;
        res *= tmp;
        for (j = 0; j < n; j++) {
            if (j == i) continue;
            tmp = a[j][i];
            for (k = 0; k < m; k++) a[j][k] -= a[i][k] * tmp;
        }
    }
    r.clear();
    for (int i = 0; i < n; i++) {
        r.push_back(a[i][n]);
    }
    return res;
}

const int maxn = 1000 + 5;
int n, m, k;
int a[maxn][maxn];
int x[maxn];
int y[maxn];
int z[maxn];
int t[maxn];
int nxt[maxn][maxn];
int f[maxn][maxn][2];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};

int inside(int u, int v) {
    if (!(u >= 0 && u < n)) return 0;
    if (!(v >= 0 && v < m)) return 0;
    return 1;
}

int calc(int u, int v, int d) {
    if (a[u][v] == '#' || a[u][v] == '*') return 0;
    if (a[u][v] == '%') return 1;
    ms(f, 0);
    f[u][v][d] = 1;
    queue<int> que;
    que.push(u), que.push(v), que.push(d);
    while (sz(que)) {
        int u = que.front(); que.pop();
        int v = que.front(); que.pop();
        int d = que.front(); que.pop();
        if (a[u][v] == '%') return 1;
        if (!d && ~nxt[u][v]) {
            int nu = nxt[u][v] / m;
            int nv = nxt[u][v] % m;
            int nd = 1;
            if (!f[nu][nv][nd]) {
                que.push(nu), que.push(nv), que.push(nd);
                f[nu][nv][nd] = 1;
            }
        }
        else {
            FOR(i, 0, 4) {
                int nu = u + dx[i];
                int nv = v + dy[i];
                int nd = 0;
                if (inside(nu, nv) && a[nu][nv] != '#' && a[nu][nv] != '*' && !f[nu][nv][nd]) {
                    que.push(nu), que.push(nv), que.push(nd);
                    f[nu][nv][nd] = 1;
                }
            }
        }
    }
    return 0;
}

void solve() {
    cin >> n >> m >> k;
    int st = 0;
    FOR(i, 0, n) {
        string s; cin >> s;
        FOR(j, 0, m) {
            a[i][j] = s[j];
            if (s[j] == 'A') {
                st = i * m + j;
            }
        }
    }
    ms(nxt, -1);
    FOR(i, 0, k) {
        cin >> x[i] >> y[i] >> z[i] >> t[i], x[i]--, y[i]--, z[i]--, t[i]--;
        nxt[x[i]][y[i]] = z[i] * m + t[i];
        nxt[z[i]][t[i]] = x[i] * m + y[i];
    }
    MATRIX mat(n * m * 2, ROW(n * m * 2 + 1));
    FOR(i, 0, n) FOR(j, 0, m) FOR(d, 0, 2) {
        int ix = (i * m + j) * 2 + d;
        if (!calc(i, j, d)) {
            mat[ix][ix] = 1;
            mat[ix][n * m * 2] = 0;
        }
        else if (a[i][j] == '%') {
            mat[ix][ix] = 1;
            mat[ix][n * m * 2] = 1;
        }
        else if (!d && ~nxt[i][j]) {
            mat[ix][ix] = 1;
            mat[ix][nxt[i][j] * 2 + 1] = -1;
        }
        else {
            mat[ix][ix] = 1;
            int tot = 0;
            FOR(t, 0, 4) {
                int ni = i + dx[t];
                int nj = j + dy[t];
                if (inside(ni, nj) && a[ni][nj] != '#') {
                    tot++;
                }
            }
            FOR(t, 0, 4) {
                int ni = i + dx[t];
                int nj = j + dy[t];
                if (inside(ni, nj) && a[ni][nj] != '#') {
                    int ix2 = (ni * m + nj) * 2;
                    mat[ix][ix2] = -1.0 / tot;
                }
            }
        }
    }
    ROW r;
    double det = MatrixDeterminant(mat, r);
    cout << prec(9) << r[st * 2] << "\n";
}

int main() {
    int JUDGE_ONLINE = 1;
    if (fopen("in.txt", "r")) {
        JUDGE_ONLINE = 0;
        assert(freopen("in.txt", "r", stdin));
        //assert(freopen("out.txt", "w", stdout));
    }
    else {
        ios_base::sync_with_stdio(0), cin.tie(0);
    }
    solve();
    if (!JUDGE_ONLINE) {
        //cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    }
    return 0;
}