from scipy.signal import fftconvolve
import numpy as np
import copy
p = 1009
M,N = map(int,input().split())
K1 = list(map(int,input().split()))
K = 0
for j in range(M+1):
    K += K1[j]*pow(p,j)

x = np.array(list(map(int,input().split())))
h = copy.deepcopy(x)

# FFTを使った畳み込み
for i in range(2,K+1):
    h = fftconvolve(x, h, mode='full')
    h = np.array([round(h[j])%p for j in range(N+1)])
print(*h)