#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=15+5,M=(1<<15)+5,K=14348907+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,k,m,Po[N];ll p[N],f[M],ans[M],S1[M],S2[M];char s[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
const int inv=mpow(10000);
int tg[K],g[K],lob[K];
void Solve(){
	int i,j,h;scanf("%d%d",&k,&n);m=1<<k;
	for(i=0;i<k;i++) scanf("%lld",&p[i]),p[i]=p[i]*inv%mod;
	for(i=0;i<m;i++) {
		S1[i]=1;
		for(j=0;j<k;j++) if(i>>j&1) S1[i]=S1[i]*p[j]%mod;
		S2[i]=1;
		for(j=0;j<k;j++) if(i>>j&1) S2[i]=S2[i]*(mod+1-p[j])%mod;
	}
	Me(f,0);Me(tg,0);
	f[0]=1;
	ll tot=0;
	for(i=0;i<m-1;i++){
		ll q=1;for(j=0;j<k;j++) if(!(i>>j&1)) q=q*(mod+1-p[j])%mod;
		f[i]=f[i]*mpow(mod+1-q)%mod;tot+=f[i];
		int x=(m-1)^i;
		for(j=x;j;j=(j-1)&x){
			f[i|j]=(f[i|j]+f[i]*S1[j]%mod*S2[x^j])%mod;
		}
	}
	for(Po[0]=i=1;i<=k;i++) Po[i]=Po[i-1]*3;
	for(i=1;i<=n;i++) {
		scanf("%s",s);int x=0;
		for(j=0;j<k;j++) if(s[j]=='1') x+=Po[j];
		tg[x]=i;
	}
	Me(ans,0);
	for(i=0;i<Po[k];i++){
		if(!g[i]) continue;
		int p=lob[i],a=tg[i-Po[p]],b=tg[i-Po[p]*2];
		if(a==-1||b==-1||(a&&b)) tg[i]=-1;
		else{
			tg[i]=a+b;
			if(tg[i]) ans[tg[i]]-=f[(m-1)^g[i]];
		}
	}
	for(i=1;i<=n;i++) printf("%lld\n",(ans[i]+tot)%mod);
}
void init(){
	for(int i=0;i<14348907;i++) g[i]=g[i/3]<<1|(i%3==2),lob[i]=(i%3==2?0:lob[i/3]+1);
}
int main(){
	int t;init();
	scanf("%d",&t);
	// t=1;                                                                                       
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}