#include<iostream>
#include<cstring>
#include<vector>
#include<bitset>
using namespace std;
using LL = long long;
const int mod = 1e9 + 7;
void add(int &a, int b){
    a += b;
    if (a >= mod) a -= mod;
}

int pow2[1005];

bitset<5000> bs[2][1000];

int solve(bitset<5000> bs0, bitset<5000> bs1, int i){
    if (!bs0.any() and !bs1.any()) return pow2[i + 1];
    if (i < 0) return !bs1.any();
    int ans = 0;
    if (!(bs[0][i] & bs1).any()) 
        add(ans, solve(bs0 ^ (bs0 & bs[0][i]), bs1, i - 1));
    if (!(bs[1][i] & bs0).any()) 
        add(ans, solve(bs0, bs1 ^ (bs1 & bs[1][i]), i - 1));
    // cout << i << ' ' << ans << '\n';
    return ans;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, m, q;
    cin >> n >> m >> q;
    pow2[0] = 1;
    for(int i = 1; i <= n; i++){
        pow2[i] = pow2[i - 1] * 2 % mod;
    }
    for(int i = 0; i < n; i++){
        string s;
        cin >> s;
        for(int j = 0; j < m; j++){
            bs[s[j] - '0'][i].set(j);
        }
    }
    while(q--){
        bitset<5000> p[2];
        string s;
        cin >> s;
        for(int j = 0; j < m; j++){
            p[s[j] - '0'].set(j);
        }
        cout << solve(p[0], p[1], n - 1) << '\n';
    }

}