#include<iostream>
#include<cstring>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
using LL = long long;
const int mod = 1e9 + 7;

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;
    vector<string> s(m, string(n, '0'));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> s[j][n - 1 - i];
        }
    }
    vector<int> id(m);
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](int a, int b){
        return s[a] < s[b];
    });
    vector<int> rk(n);
    for(int i = 0; i < n; i++){
        rk[id[i]] = i;
    }
    vector<int> val(m);
    for(int i = 0; i < m; i++){
        for(auto c : s[i]){
            val[i] = (val[i] * 2 + (c - '0')) % mod;
        }
    }
    while(q--){
        string s;
        cin >> s;
        int mx = 1e9, mn = -1;
        for(int i = 0; i < m; i++){
            if (s[i] == '0'){
                mn = max(mn, rk[i]);
            }
            else{
                mx = min(mx, rk[i]);
            }
        }
        if (mn >= mx) cout << 0 << '\n';
        else cout << (val[id[mx]] - val[id[mn]] + mod) % mod << '\n';
    }

}