#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;
#include <atcoder/modint>
//using Modint = atcoder::static_modint<998244353>;
using Modint = atcoder::static_modint<1009>;

void testcase(){
    int P = 1009;
    i64 M, N; cin >> M >> N;
    vector<i64> K(M+1);
    rep(i,M+1) cin >> K[i];
    vector<Modint> A(N+1);
    rep(i,N+1){ int a; cin >> a; A[i] = a; }
    auto conv = [](vector<Modint> a, vector<Modint> b, int n) -> vector<Modint> {
        vector<Modint> res(n);
        rep(i,n) rep(j,n-i) if(i+j<n) res[i+j] += a[i] * b[j];
        return res;
    };
    auto powa = [&](auto& powa, int n, int x) -> vector<Modint> {
        if(x == 0){
            vector<Modint> R(n);
            if(n >= 1) R[0] = 1;
            return R;
        }
        auto V = powa(powa, n, x/2);
        auto W = conv(V, V, n);
        if(x % 2 == 1) W = conv(W, vector<Modint>(A.begin(), A.begin()+n), n);
        return W;
    };
    auto solve = [&](auto& solve, int n, int m) -> vector<Modint> {
        if(n == 0){
            Modint ans = 1;
            for(int k=M; k>=m; k--){
                ans *= A[0].pow(K[k]);
            }
            return vector<Modint>(1, ans);
        }
        if(m == M){
            return powa(powa, n+1, K[m]);
        }
        auto re = solve(solve, n/P, m+1);
        vector<Modint> res(n+1);
        rep(i,re.size()) res[i*P] = re[i];
        res = conv(res, powa(powa, n+1, K[m]), n+1);
        return res;
    };
    auto ans = solve(solve, N, 0);
    rep(i,N+1){
        if(i) cout << ' ';
        cout << ans[i].val();
    } cout << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}