#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> PII;
map<PII,PII>m;
vector<string>s;

int x1[4]={1,0,-1,0};
int y5[4]={0,1,0,-1};
bool vis[21][21];
int n;
int m1;
int path(int x,int y)
{
    queue<PII>q;
    q.push(make_pair(x,y));
    int sum=0;
    int l=0;
    while(!q.empty())
    {
        PII p=q.front();
        q.pop();
        int i=p.first;
        int j=p.second;
        //cout<<i<<" "<<j<<" "<<endl;
        vis[i][j]=true;
        for(int k=0;k<4;k++)
        {
            int u=i+x1[k];
            int v=j+y5[k];
            if(u<0||v<0|u>=n||v>=m1)
            	continue;
            
            sum++;
            if(l==0)
            {
	            if(vis[u][v]==false)
	            {
	                if(s[u][v]=='%')
	                {
	                    l++;
	                   
	                }
	                if(s[u][v]=='O')
	                {
	                   if(m.find(make_pair(u,v))!=m.end())
	                   {	                   	
	                   		q.push(m[make_pair(u,v)]);	                   			              		   	
	                   }
	                    else
	                    {
	                        q.push(make_pair(u,v));
	                       
	                    }
	                }
	            }
        }   }
        
    }
    return sum;
}
int main() {
//	freopen("in.txt","r",stdin);
 // freopen("out1.txt","w",stdout);
    
    int k,i,j,x,y;
    cin >> n >> m1>> k;
    for(int a0 = 0; a0 < n; a0++){
        string row;
        cin >> row;
        s.push_back(row);
        for(i=0;i<m1;i++)
        {
            if(row[i]=='A')
            {
                x=a0;
                y=i;
            }
        }
    }
    for(int a0 = 0; a0 < k; a0++){
        int i1;
        int j1;
        int i2;
        int j2;
        cin >> i1 >> j1 >> i2 >> j2;
        i1=i1-1;
        i2=i2-1;
        j1=j1-1;
        j2=j2-1;
        m[make_pair(i1,j1)]=make_pair(i2,j2);
        m[make_pair(i2,j2)]=make_pair(i1,j1);
        // Write Your Code Here
    }
    // Write Your Code Here
   int z=path(x,y);
 	//cout<<z;
    double p=1/pow(z,1);
    cout<<p;
    return 0;
}