#include<cstdio>

#include<cmath>

#include<cstring>

#include<iostream>

#include<algorithm>

int cnt,sz=,f[*][],c[][],id[][],vis[][],n,m,a[],b[],ans[*],d[*];

int read(){

    char ch=getchar();int f=,t=;

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

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

    return t*f;

}

void dfs(int x,int y){

    int dx=x+a[c[x][y]],dy=y+b[c[x][y]];

    if (dx<||dx>n||dy<||dy>m) f[id[x][y]][c[x][y]]=id[x][y];

    else{

        f[id[x][y]][c[x][y]]=id[dx][dy];

        if (!vis[dx][dy]) {vis[dx][dy]=;dfs(dx,dy);}

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

            if (i!=c[x][y])

                f[id[x][y]][i]=f[id[dx][dy]][i];

    }

}

int main(){

    n=read();m=read();int T=read();cnt=;

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

        char s[];

        scanf("%s",s+);

        for (int j=;j<=m;j++){

            c[i][j]=s[j]-'';id[i][j]=++cnt;d[cnt]=c[i][j];
　　　　　}

    }
　　 char s[1000005];

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

        a[i]=read(),b[i]=read();

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

        for (int j=;j<=m;j++)

            if (!vis[i][j]){

                vis[i][j]=;

                ans[++sz]=id[i][j];

                dfs(i,j);

            }while (T--){

        scanf("%s",s+);bool flag=false;

        for (int i=;i<=sz;i++){

            int x=ans[i];

            for (int j=;j<=strlen(s+);j++){

                x=f[x][s[j]-''];if (x<=) break;

            }

            if (x>) {flag=true;break;}

        }

        if (flag) printf("YES\n");else printf("NO\n");

    }

}