#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7; 

inline int poww(int a, int b) {
    int r = 1; 
    for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) r = 1ll * r * a % P; 
    return r; 
}
inline int inv(int x) { return poww(x, P - 2); }

int n, k, p[10]; 
int f[45][170], g[45][170], C[45][45]; 

void solve(void) {
    cin >> n >> k; 
    for (int i = 0; i <= k; ++i) cin >> p[i], p[i] = 1ll * p[i] * inv(100) % P; 
    p[k + 1] = p[0]; 
    for (int i = k; i >= 1; --i) p[i] = (p[i] + p[i + 1]) % P; 

    memset(f, 0, sizeof f); f[1][0] = 1; 
    for (int t = 1; t <= k; ++t) {
        memset(g, 0, sizeof g); 
        for (int i = 1; i <= n; ++i) for (int j = 0; j <= (i - 1) * t; ++j) {
            g[i][j] = f[i][j]; 
            for (int x = 1; x < i; ++x) for (int y = 0; y + t <= j; ++y)
                g[i][j] = (g[i][j] + 1ll * g[i - x][j - y - t] * f[x][y] % P * poww(p[t], x * (i - x)) % P * C[i - 1][x - 1]) % P; 
        }
        memset(f, 0, sizeof f); 
        for (int i = 1; i <= n; ++i) for (int j = 0; j <= (i - 1) * t; ++j) {
            f[i][j] = g[i][j]; 
            for (int x = 1; x < i; ++x) for (int y = 0; y + t <= j; ++y)
                f[i][j] = (f[i][j] - 1ll * g[i - x][j - y - t] * f[x][y] % P * poww(p[t + 1], x * (i - x)) % P * C[i - 1][x - 1]) % P; 
        }
    }

    for (int i = n - 1; i <= k * (n - 1); ++i) cout << (f[n][i] + P) % P << " \n"[i == k * (n - 1)]; 
}

int main(void) {
    for (int i = 0; i <= 44; ++i)
        for (int j = C[i][0] = 1; j <= i; ++j)
            C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P; 
    
    ios::sync_with_stdio(0); 
    int T; cin >> T; 
    while (T--) solve(); 
    return 0;
}