#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
constexpr int p = 1009;
using mint = static_modint<p>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int m, n;
  cin >> m >> n;
  m++, n++;
  VI k(m);
  vector<mint> a(n);
  rep(i, m) cin >> k[i];
  rep(i, n) { int x; cin >> x; a[i] = x; }
  int mx = 0;
  rrep(i, m) mx = min(mx * p + k[i], n - 1);
  VI knmx = k;
  knmx[0] -= mx;
  rep(i, m) {
    if (knmx[i] >= 0) break;
    int c = (-knmx[i] + p - 1) / p;
    knmx[i] += c * p;
    knmx[i+1] -= c;
  }
  vector<mint> coeff(mx + 1);
  {
    mint x = 1;
    rrep(i, m) x = x.pow(p) * a[0].pow(knmx[i]);
    coeff[mx] = x;
    rrep(i, mx) coeff[i] = coeff[i+1] * a[0];
  }
  {
    mint c = 1;
    int e = 0;
    rep(i, mx + 1) {
      coeff[i] *= e == 0 ? c : mint();
      if (i == mx) break;
      if (i + 1 == p) e--;
      else c /= i + 1;
      int idx = 0;
      while (k[idx] == 0) idx++;
      e += idx;
      c *= k[idx]--;
      rep(i, idx) k[i] = p - 1;
    }
  }
  using m9 = static_modint<2032156673>;
  vector<m9> f(n), fk(n);
  rep(i, n) if (i) f[i] = a[i].val();
  fk[0] = 1;
  vector<mint> ans(n);
  rep(k, mx + 1) {
    rep(i, n) ans[i] += 1ULL * fk[i].val() * coeff[k].val();
    if (k == mx) break;
    fk = convolution(f, fk);
    fk.resize(n);
    rep(i, n) fk[i] = fk[i].val() % p;
  }
  rep(i, n) cout << ans[i].val() << " \n"[i + 1 == n];
}