#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n;
int a[100005][10];
int m , k;
int b[10];

int f[1 << 8][1 << 16];
int g[1 << 16];
int qpow(int a,int b) {
    int ans = 1;
    while(b) {
        if(b & 1) ans = 1LL * ans * a %mod;
        a = 1LL * a * a %mod;b >>= 1;
    }
    return ans;
}
void dec(int &x,int y) {
    ((x -= y) < 0 ? (x += mod) : 0) ;
}
int sp[1<<8];
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0);
    cin >> n >> m >> k;
    // printf("%d %d %d\n",n,m,k);
    for(int i = 1;i <= k;i++) {
        cin >> b[i]; b[i] = 1LL * b[i] * qpow(1000000000 , mod - 2) % mod;
    }
    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= k;j++) {
            cin >> a[i][j];
        }
    }
    for(int i = 0;i < (1<<m);i++) g[i] =1;
    for(int i = 0;i < (1<<k);i++) {
        vector<int> v;
        int ssp = 0;
        for(int l = 0;l < k;l++) {
            if((i >> l) & 1) {
                v.push_back(l + 1);ssp = (ssp + b[l + 1]) % mod;
            }
        }
        sp[i] = ssp;
        // printf("S %d\n",sp);
        for(int j = 1;j <= n;j++) {
            int s = 0;
            for(auto x : v) s |= a[j][x];
            f[i][s]++;
        }
        for(int j = 0;j < m;j++) {
            for(int l = 0;l < (1<<m);l++) {
                if((l >> j) & 1) f[i][l] += f[i][l ^ (1<<j)];
            }
        }
    }
    for(int i = 0;i < (1<<m);i++) {
        for(int j = 0;j < k;j++) {
            for(int l = 0 ; l < (1<<k) ;l++) {
                if(!((l >> j) & 1)) dec(f[l][i] , f[l ^ (1<<j)][i]) ;
            }
        }
    }
    for(int i = 0;i < (1<<k);i++) {
        vector<int> pw(n + 1);
        pw[0] = 1;
        for(int j = 1;j <= n;j++) pw[j] = 1LL * pw[j - 1] * sp[i] % mod;
        for(int j = 0;j < (1<<m);j++) {
            g[j] = 1LL * g[j] * pw[f[i][j]] % mod;
        }
    }
    for(int i = 0;i < m;i++) {
        for(int j = 0;j < (1<<m);j++) {
            if((j >> i) & 1) g[j] = (g[j] - g[j ^ (1<<i)] + mod) % mod;
        }
    }
    for(int i = 0;i < (1<<m);i++) cout << g[i] << '\n';
    return 0;
}