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

int N, M;

int coord(int i, int j) {
    return i*M + j;
}

pair<int, int> decom(int id) {
    return {id/M, (id%M)};
}

int dr[] = {0, 0, -1, 1};
int dc[] = {-1, 1, 0, 0};

double ep = 1e-7;

vector<vector<double> > matmul(vector<vector<double> > &A, vector<vector<double> > &B, int sz) {
    vector<vector<double> > C(1, vector<double>(sz, 0));
    for (int i = 0; i < 1; ++i) {
        for (int j = 0; j < sz; ++j) {
            for (int k = 0; k < sz; ++k)
                C[i][j] += A[i][k] * B[k][j];
        }
    }
    return C;
}

int main() {
    int T;    cin>>N>>M>>T;
    vector<string> grid(N);
    for (int i = 0; i < N; ++i)
        cin>>grid[i];
    vector<int> tunnel(N*M);
    for (int i = 0; i < N*M; ++i)
        tunnel[i] = i;
    for (int i = 0; i < T; ++i) {
        int x1, y1, x2, y2; cin>>x1>>y1>>x2>>y2;
        tunnel[coord(x1-1, y1-1)] = coord(x2-1, y2-1);
        tunnel[coord(x2-1, y2-1)] = coord(x1-1, y1-1);
    }
    
    vector<vector<double> > mat(N*M, vector<double>(N*M, 0));
    set<int> exits;
    int alex;
    
    for (int i = 0; i < N*M; ++i) {
        pair<int, int> temp = decom(i);
        int x = temp.first, y = temp.second;
        if (grid[x][y] == '#' || grid[x][y] == '*')
            continue;
        
        if (grid[x][y] == 'A')
            alex = i;
        else if (grid[x][y] == '%')
            exits.insert(i);
        
        int cnt = 0;
        for (int k = 0; k < 4; ++k) {
            int nx = x + dr[k];
            int ny = y + dc[k];
            if (nx < 0 || ny < 0 || nx == N || ny == M)
                continue;
            if (grid[nx][ny] != '#')
                cnt++;
        }
        
        for (int k = 0; k < 4; ++k) {
            int nx = x + dr[k];
            int ny = y + dc[k];
            if (nx < 0 || ny < 0 || nx == N || ny == M)
                continue;
            //cout<<x<<" "<<y<<" "<<nx<<" "<<ny<<" "<<coord(nx, ny)<<"\n";
            if (grid[nx][ny] != '#')
                mat[i][tunnel[coord(nx, ny)]] = 1.0/cnt;
        }
    }
    /*
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j)
            cout<<coord(i, j)<<" ";
        cout<<"\n";
    }
    
    for (int i = 0; i < N*M; ++i) {
        for (int j = 0; j < N*M; ++j)
            printf("%.2lf ", mat[i][j]);
        printf("\n");
    }
    */
    vector<vector<double> > res(1, vector<double>(N*M, 0));
    res[0][alex] = 1;
    res = matmul(res, mat, N*M);
    while (true) {
        bool cont = true;
        for (int exit : exits) {
            //cout<<printf("%.8lf ", res[0][exit]);
            if (fabs(res[0][exit]-0.0) > ep) {
                printf("%.8lf ", res[0][exit]);
                cont = false;
                break;
            }
        }
        if (!cont)
            break;
        //cout<<"\n";
        res = matmul(res, mat, N*M);
    }
    
    return 0;
}