R=range
J=lambda:list(map(int,input().split()))
P=1009
M,N,*_=J()
M+=1
N+=1
K=J()
A=J()
def c(f,g,d):return[sum(f[j]*g[i-j]for j in R(i+1))%P for i in R(d)]
def p(f,n,d):
	a=[0]*d;a[0]=1
	while n:
		if n&1:a=c(a,f,d)
		f=c(f,f,d);n>>=1
	return a
Q=[N]*(M+1);Q[0]=1
e=0
a=[0]*N;a[0]=1
for m in R(M):
	if Q[m]<N:
		B=p(A,K[m],(N-1)//Q[m]+1);t=[0]*N;Q[m+1]=Q[m]*P
		for i in R(N):
			for j in R((N-1-i)//Q[m]+1):t[i+j*Q[m]]+=a[i]*B[j]
		a=[x%P for x in t]
	else:e+=K[m]
s=pow(A[0],e,P)
print(*[x*s%P for x in a])