#include<bits/stdc++.h>
using namespace std;
const int N=1551,M=N*N;
int n,m,Q,S,T,nm;
char s[M];
int dir[4];
bool f[M][4];
inline int id(int x,int y){return x*(m+1)+y;}
int dfn[M],st[M],tp,low[M],cntdfn,scc,fa[M<<1];
inline void tarjan(int x,int lst){
    dfn[x]=low[x]=++cntdfn;
    st[++tp]=x;
    for(int i=0;i<4;i++)if(i^lst){
        int y=x+dir[i];
        if(s[y]!='.')continue;
        if(!dfn[y]){
            tarjan(y,i^1);
            low[x]=min(low[x],low[y]);
            if(dfn[x]<=low[y]){
                scc++;
                fa[nm+scc]=x;
                while(st[tp]!=x){
                    fa[st[tp]]=nm+scc;
                    tp--;
                }
            }
        }
        else low[x]=min(low[x],dfn[y]);
    }
}
inline bool reach(int x,int y){return fa[x]==fa[y]||fa[fa[x]]==y||fa[fa[y]]==x;}
namespace step1{
    bool vis[M];
    inline void solve(){
        queue<int>q;
        vis[S]=vis[T]=1;
        q.push(S);
        while(!q.empty()){
            int x=q.front();
            q.pop();
            for(int i=0;i<4;i++){
                int y=x+dir[i];
                if(s[y]=='.'&&!vis[y])q.push(y),vis[y]=1;
            }
        }
    }
}
inline void solve(){
    queue<pair<int,int> >q;
    for(int i=0;i<4;i++){
        int x=T+dir[i^1];
        if(!step1::vis[x])continue;
        f[T][i]=1;
        q.push({T,i});
    }
    while(!q.empty()){
        int x=q.front().first,d=q.front().second;
        q.pop();
        int y=x+dir[d];
        if(s[y]=='.'&&!f[y][d]){
            f[y][d]=1;
            q.push({y,d});
        }
        int lst=x+dir[d^1];
        for(int i=0;i<4;i++)if(!f[x][i]){
            int y=x+dir[i^1];
            if(s[y]=='.'&&reach(lst,y)){
                f[x][i]=1;
                q.push({x,i});
            }
        }
    }
}
inline bool solve(int x){
    if(x==T)return 1;
    for(int i=0;i<4;i++)if(f[x][i])return 1;
    return 0;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
    cin>>n>>m>>Q;
    nm=(n+1)*(m+1);
    dir[0]=-m-1,dir[1]=m+1,dir[2]=-1,dir[3]=1;
    for(int i=1;i<=n;i++){
        cin>>(s+i*(m+1)+1);
        for(int j=i*(m+1)+1;j<=i*(m+1)+m;j++){
            if(s[j]=='A')S=j,s[j]='.';
            else if(s[j]=='B')T=j,s[j]='.';
        }
    }
    tarjan(S,-1);
    step1::solve();
    solve();
    // for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cout<<solve(id(i,j))<<" \n"[j==m];
    while(Q--){
        int x,y;
        cin>>x>>y;
        if(solve(id(x,y)))cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}
/*
5 5 1
.....
.###.
.#.#.
A.B..
##.##
1 1
*/