#include<queue>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int N = ;

template<typename T>

inline void read(T&x)

{

    T f = ,c = ;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){c=c*+ch-'';ch=getchar();}

    x = f*c;

}

int n,m,Q,nam[N][N],tot,rtx,rty,rt,stx,sty,st,hed[N*N],cnt=;

char mp[N][N];

bool check(int x,int y){return x&&y&&x<=n&&y<=m;}

int dx[]={-,,,},dy[]={,,-,};

struct EG

{

    int to,nxt;

}e[*N*N];

void ae(int f,int t)

{

    e[++cnt].to = t;

    e[cnt].nxt = hed[f];

    hed[f] = cnt;

}

int dfn[N*N],low[N*N],tim,fa[N*N*];

int sta[N*N*],tl;

void tarjan(int u,int f)

{

    dfn[u] = low[u] = ++tim;

    sta[++tl] = u;

    for(int j=hed[u];j;j=e[j].nxt)

    {

        int to = e[j].to;

        if(to==f)continue;

        if(!dfn[to])

        {

            tarjan(to,u);

            low[u] = min(low[u],low[to]);

            if(low[to]>=dfn[u])

            {

                int now = ++tot;

                fa[now] = u;

                int c = -;

                while(c!=to)

                {

                    c = sta[tl--];

                    fa[c] = now;

                }

            }

        }else    low[u] = min(low[u],dfn[to]);

    }

}

bool ck(int u,int v)

{

    if(fa[u]==fa[v])return ;

    if(fa[fa[v]]==u)return ;

    if(fa[fa[u]]==v)return ;

    return ;

}

bool dp[N][N][];

bool vis[N][N];

struct Pair

{

    int x,y;

    Pair(){}

    Pair(int x,int y):x(x),y(y){}

};

void bfs()

{

    queue<Pair>q;

    q.push(Pair(rtx,rty));

    vis[rtx][rty] = ;

    while(!q.empty())

    {

        Pair tp = q.front();q.pop();

        int x = tp.x,y = tp.y;

        for(int k=;k<;k++)

        {

            int xx = x+dx[k],yy = y+dy[k];

            if(!nam[xx][yy])continue;

            if(xx==stx&&yy==sty)dp[stx][sty][k]=;

            else if(!vis[xx][yy])vis[xx][yy]=,q.push(Pair(xx,yy));

        }

    }

}

struct Tri

{

    int x,y,z;

    Tri(){}

    Tri(int x,int y,int z):x(x),y(y),z(z){}

};

void sol()

{

    queue<Tri>q;

    for(int k=;k<;k++)if(dp[stx][sty][k])

        q.push(Tri(stx,sty,k));

    while(!q.empty())

    {

        Tri tp = q.front();

        q.pop();

        int x = tp.x,y = tp.y,k = tp.z;

        if(nam[x+dx[k]][y+dy[k]]&&!dp[x+dx[k]][y+dy[k]][k])dp[x+dx[k]][y+dy[k]][k]=,q.push(Tri(x+dx[k],y+dy[k],k));

        for(int i=;i<;i++)if(nam[x-dx[i]][y-dy[i]]&&i!=k&&ck(nam[x-dx[k]][y-dy[k]],nam[x-dx[i]][y-dy[i]])&&!dp[x][y][i])

            dp[x][y][i]=,q.push(Tri(x,y,i));

    }

}

bool cck(int x,int y){return dp[x][y][]||dp[x][y][]||dp[x][y][]||dp[x][y][]||(x==stx&&y==sty);}

int main()

{

//    freopen("tt.in","r",stdin);

    read(n),read(m),read(Q);

    for(int i=;i<=n;i++)

    {

        scanf("%s",mp[i]+);

        for(int j=;j<=m;j++)if(mp[i][j]!='#')

        {

            nam[i][j] = ++tot;

            if(mp[i][j]=='A')rt=tot,rtx=i,rty=j;

            if(mp[i][j]=='B')st=tot,stx=i,sty=j;

        }

    }

    for(int i=;i<=n;i++)for(int j=;j<=m;j++)if(mp[i][j]!='#')

    {

        int u = nam[i][j];

        for(int x,y,k=;k<;k++)

        {

            x = i+dx[k],y = j+dy[k];

            if(!check(x,y)||mp[x][y]=='#')continue;

            ae(u,nam[x][y]);

        }

    }

    tarjan(rt,);

    bfs();sol();

    for(int x,y,i=;i<=Q;i++)

    {

        read(x),read(y);

        puts(cck(x,y)?"YES":"NO");

    }

    return ;

}