#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int mod = 1e9 + 7;

void add(int &x, int y) { if ((x += y - mod) < 0) x += mod; }
void sub(int &x, int y) { if ((x -= y) < 0) x += mod; }
int mpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = (ll)ret * a % mod;
    a = (ll)a * a % mod;
  }
  return ret;
}

const int K = 4;
const int N = 40;
const int S = K * N;
const int LIM = N * (N - 1) / 2;

int n, k, tk;
int p[K + 5], fac[N + 5], ifac[N + 5], inv[N + 5];
int pw[LIM + 5], ipw[LIM + 5];
int f[K + 5][N + 5][S + 5], g[N + 5][S + 5], h[N + 5][S + 5];
int ans[S + 5];

void solve() {
  scanf("%d%d", &n, &k); int nv = mpow(100, mod - 2);
  for (int i = 0; i <= k; ++i) scanf("%d", p + i), p[i] = (ll)p[i] * nv % mod;
  for (tk = k; !p[k]; --k);
  fac[0] = 1;
  for (int i = 1; i <= n; ++i) fac[i] = (ll)fac[i - 1] * i % mod;
  ifac[n] = mpow(fac[n], mod - 2);
  for (int i = n; i; --i) ifac[i - 1] = (ll)ifac[i] * i % mod;
  for (int i = 1; i <= n; ++i) inv[i] = (ll)ifac[i] * fac[i - 1] % mod;
  memset(f, 0, sizeof f);
  f[0][1][0] = 1;
  for (int v = 1, q = 1; v <= k; ++v) {
    int iq = mpow(q, mod - 2);
    pw[0] = ipw[0] = 1;
    for (int i = 1; i <= n * (n - 1) / 2; ++i)
      pw[i] = (ll)pw[i - 1] * q % mod,
      ipw[i] = (ll)ipw[i - 1] * iq % mod;
    memset(h, 0, sizeof h);
    for (int i = 1; i <= n; ++i)
      for (int s = 0; s <= (v - 1) * (i - 1); ++s)
        if (f[v - 1][i][s])
          h[i][s + v] = (ll)f[v - 1][i][s] * ipw[i * (i - 1) / 2] % mod;
    memset(g, 0, sizeof g), g[0][0] = 1;
    for (int i = 1; i <= n; ++i)
      for (int s = 0; s <= v * i; ++s) {
        for (int j = 1; j <= i; ++j)
          for (int t = 0; t <= (v - 1) * j + 1 && t <= s; ++t)
            if (h[j][t] && g[i - j][s - t])
              g[i][s] = (g[i][s] + (ll)j * h[j][t] % mod * g[i - j][s - t]) % mod;
        g[i][s] = (ll)g[i][s] * inv[i] % mod;
      }
    for (int i = 0; i <= n; ++i)
      for (int s = 0; s <= v * i; ++s)
        g[i][s] = (ll)g[i][s] * pw[i * (i - 1) / 2] % mod;
    if (p[0] == 0 && v == k) {
      for (int i = 1; i <= n; ++i)
        for (int s = v; s <= v * i; ++s)
          f[v][i][s - v] = g[i][s];
      break;
    }
    sub(q, p[v]), iq = mpow(q, mod - 2);
    for (int i = 1; i <= n * (n - 1) / 2; ++i)
      pw[i] = (ll)pw[i - 1] * q % mod,
      ipw[i] = (ll)ipw[i - 1] * iq % mod;
    for (int i = 0; i <= n; ++i)
      for (int s = 0; s <= v * i; ++s)
        g[i][s] = (ll)g[i][s] * ipw[i * (i - 1) / 2] % mod;
    memset(h, 0, sizeof h);
    for (int i = 1; i <= n; ++i)
      for (int s = 0; s <= v * i; ++s) {
        h[i][s] = (ll)g[i][s] * i % mod;
        for (int j = 1; j < i; ++j)
          for (int t = 0; t <= v * j && t <= s; ++t)
            if (h[j][t] && g[i - j][s - t])
              h[i][s] = (h[i][s] + (ll)(mod - j) * h[j][t] % mod * g[i - j][s - t]) % mod;
        h[i][s] = (ll)h[i][s] * inv[i] % mod;
      }
    for (int i = 1; i <= n; ++i)
      for (int s = v; s <= v * i; ++s)
        f[v][i][s - v] = (ll)h[i][s] * pw[i * (i - 1) / 2] % mod;
  }
  for (int i = 0; i <= k * (n - 1); ++i) ans[i] = (ll)f[k][n][i] * fac[n] % mod;
  fill(ans + k * (n - 1) + 1, ans + tk * (n - 1) + 1, 0);
  k = tk;
  for (int i = n - 1; i <= k * (n - 1); ++i) printf("%d%c", ans[i], " \n"[i == k * (n - 1)]);
}

int T;

int main() {
  for (scanf("%d", &T); T; --T) solve();
}