#include<bits/stdc++.h>
using namespace std;
constexpr int N=1005,M=5005,mod=1e9+7;
char str[N][M],res[M];
int n,m,q,rnk[M],tmp[M],rec[M];
int rdc(int x){return x>=mod?x-mod:x;}
int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>m>>q;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            cin>>str[i][j];
    for (int i=1;i<=m;i++) rnk[i]=i;
    for (int i=1;i<=n;i++){
        int cnt[]={0,0};
        for (int j=1;j<=m;j++)
            cnt[str[i][j]-'0']++;
        cnt[1]+=cnt[0];
        for (int j=m;j;j--)
            tmp[cnt[str[i][rnk[j]]-'0']--]=rnk[j];
        for (int j=1;j<=m;j++) rnk[j]=tmp[j];
    } rec[m+1]=1;
    for (int i=n;i;i--){
        for (int j=1;j<=m;j++)
            rec[j]=rdc((rec[j]<<1)|(str[i][j]-'0'));
        rec[m+1]=rdc(rec[m+1]<<1);
    } rnk[m+1]=m+1;
    for (int i=1;i<=q;i++){
        for (int j=1;j<=m;j++) cin>>res[j];
        int l=0,r=m+1;
        for (int j=1;j<=m;j++) if (res[rnk[j]]=='0') l=j;
        for (int j=m;j;j--) if (res[rnk[j]]=='1') r=j;
        printf("%d\n",l<=r?rdc(rec[rnk[r]]+mod-rec[rnk[l]]):0);
    }
    return 0;
}