#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;

inline double Mod(double v,double mod=MOD){
  return v;
}
inline ll Mod(ll v,ll mod=MOD){
  return v%mod;
}
typedef vector<vector<ll> > matl;
typedef vector<vector<double> > matd;
template<class T> vector<T> operator*(const T &a,vector<T> v){
  rep(i,v.size())
    v[i]=Mod(v[i]*a);
  return v;
}
template<class T> vector<T> operator+(vector<T> v,const vector<T> &w){
  rep(i,v.size())
    v[i]=Mod(v[i]+w[i]);
  return v;
}
template<class T> vector<vector<T> > matE(T n){
  vector<vector<T> > re(n,vector<T>(n));
  rep(i,n)
    re[i][i]=1;
  return re;
}
template<class T>vector<vector<T> >matE(vector<vector<T> >mat){
  return matE((T)(mat.size()));
}

template<class T>
vector<vector<T> > transpose(const vector<vector<T> > &a,
vector<vector<T>> &re){
  re.resize(a[0].size(),vector<T>(a.size()));
  rep(i,a[0].size())
    rep(j,a.size())
      re[i][j]=a[j][i];
  return re;
}

template<class T> T operator*(const vector<T> &a,
		     const vector<T> &b){
  T re=0;
  rep(i,a.size())
    re=Mod(re+Mod(a[i]*b[i]));
  return re;
}
template<class T> vector<vector<T> >
operator*(const vector<vector<T> > &a
,const vector<vector<T> > &b_){
  vector<vector<T> > b;
  transpose(b_,b);
  vector<vector<T> > re(a.size(),vector<T>(b.size()));
  rep(i,a.size())
    rep(j,b.size())
      re[i][j]=a[i]*b[j];
  return re;
}
template<class T>
vector<vector<T> > pow(vector<vector<T> > a,ll n){
  vector<vector<T> > re;
  if(n==0)
    return matE(a);
  re=pow(a,n/2);
  return re*re*(n%2?a:matE(a));
}

pair<matd,ll> gyohen(matd a){
  ll i,j,k,n=a.size(),agcd,m=a[0].size(),nul=0,div=1;
  rep(i,min(n,m)){
    int non0=-1;
    for(j=i-nul;j<n;j++)
      if(a[j][i]){
        non0=j;
        break;
      }
    if(non0<0){
      nul++;
    }else{
      div/=a[non0][i];
      a[non0]=(1/a[non0][i])*a[non0];
      if(non0!=i-nul){
        swap(a[non0],a[i-nul]);
        div*=-1;
      }
      for(j=0;j<n;j++){
        if(j==i-nul)continue;
        if(a[j][i]){
          if(a[j][i]<0){
            a[j]=-1.0*a[j];
            div*=-1;
          }
          a[j]=a[j]+(-a[j][i]*a[i-nul]);
        }
      }
    }
    //rep(ii,a.size()){rep(jj,a[0].size())cout<<a[ii][jj]<<",";cout<<endl;}
  }
//  cout<<div<<endl;
  return pair<matd,ll>(a,div);
}

pii tun[22][22];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1,0};

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(10);
  fill(tun[0],tun[22],pii(-1,-1));
  int n,m,t;
  cin>>n>>m>>t;
  vector<string> mp(n);
  rep(i,n) cin>>mp[i];
  rep(i,t){
    int y,x,Y,X;
    cin>>y>>x>>Y>>X; --y; --x; --Y; --X;
    tun[y][x]=pii(X,Y);
    tun[Y][X]=pii(x,y);
  }
  matd A(n*m,vector<double>(n*m+1));
  function<int(int,int)> fun=[&](int x,int y){return x+y*m;};
  int ans;
  rep(i,n)rep(j,m){
    if(mp[i][j]=='#'){
      A[fun(j,i)][fun(j,i)]=1; A[fun(j,i)].back()=0;
    }else if(mp[i][j]=='*'){
      A[fun(j,i)][fun(j,i)]=1; A[fun(j,i)].back()=0;
    }else if(mp[i][j]=='%'){
      A[fun(j,i)][fun(j,i)]=1; A[fun(j,i)].back()=1;
    }else{
      if(mp[i][j]=='A') ans=fun(j,i);
      int cnt=0;
      rep(d,4){
	int nx=j+dx[d],ny=i+dy[d];
	if(nx<0 || ny<0 || nx>=m || ny>=n || mp[ny][nx]=='#') continue;
	if(tun[ny][nx].X>=0) tie(nx,ny)=tun[ny][nx];
	A[fun(j,i)][fun(nx,ny)]=1;
	++cnt;
      }
      if(cnt) A[fun(j,i)][fun(j,i)]=-cnt;
      else A[fun(j,i)][fun(j,i)]=1;
    }
  }
  auto B=gyohen(A).X;
  //out(A,B,ans,1);
  int x;
  rep(i,B.size())if(abs(B[i][ans])>0.1) x=i;
  cout<<B[x].back()/B[x][ans]<<endl;
  
  return 0;
}