#include<bits/stdc++.h>
#define up(i,x,y) for(int i=x,i##E=y;i<=i##E;i++)
#define pu(i,x,y) for(int i=y,i##E=x;i>=i##E;i--)
using namespace std;
#define int long long
int n,m,k;
const int mod=1e9+7;
int qpow(int a,int b=mod-2)
{
	int ans=1;
	while(b)
	{
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
const int maxn=1e5+10;
int b[maxn];
int a[maxn];
const int maxm=(1<<16)+10;
int mul[maxm];
void Add(int &a,int b)
{
	a+=b;a%=mod;
}
signed main()
{
	int iv=qpow(1000000000);
	cin>>n>>m>>k;
	up(i,0,k-1)cin>>b[i],b[i]*=iv,b[i]%=mod;
	
	
	up(i,0,(1<<m)-1)mul[i]=1;
	
	up(i,1,n)
	{
		up(j,0,k-1)cin>>a[j];
		up(msk,1,(1<<k)-1)
		{
			int mk=-1;
			int val=0;
			up(j,0,k-1)
			{
				if(msk&(1<<j))
				{
					Add(val,b[j]);
					if(mk==-1)mk=a[j];
					mk&=a[j];
				}
			}
			mul[mk]*=val;
			mul[mk]%=mod;
			
		}
	}
	
	up(i,0,m-1)
	{
		up(j,0,(1<<m)-1)
		{
			if((j&(1<<i)))mul[j]*=mul[j^(1<<i)],mul[j]%=mod;
		}
	}
	
	up(i,0,m-1)
	{
		up(j,0,(1<<m)-1)
		{
			if(!(j&(1<<i)))mul[j]-=mul[j^(1<<i)],mul[j]+=mod,mul[j]%=mod;
		}
	}
	
	up(i,0,(1<<m)-1)
	{
		cout<<mul[i]<<"\n";
	}
	
	
	
	
	
	
	return 0;
}
/*
2 2 2
400000000 600000000
1 0
2 1
*/