#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, k;
const int maxN = 105;
int a[maxN], b[maxN];
const int maxK = 11;
int dp[maxN][maxN][maxK];
const int INF = 1e9;
int A[maxN][maxN];
int help[maxN][maxN][maxK];
int suf_help[maxN][maxN][maxK];
void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> A[i][j];
        }
    }
    for (int i = 0; i <= n + 1; i++) {
        for (int j = 0; j <= n + 1; j++) {
            for (int t = 0; t <= k; t++) {
                dp[i][j][t] = INF;
                suf_help[i][j][t] = INF;
                help[i][j][t] = INF;
                if (i > j) dp[i][j][t] = 0;
            }
        }
    }
    for (int l = n; l >= 1; l--) {
        for (int r = l; r <= n; r++) {
            int cnt = 0;
            for (int p = l; p <= r; p++) {
                if (a[p] != b[p]) cnt++;
            }
            if (l == r) {
                for (int c = 0; c <= k; c++) {
                    if (a[l] == b[l]) {
                        dp[l][r][c] = help[l][r][c] = suf_help[l][r][c] = 0;
                    }
                    else {
                        dp[l][r][c] = (c == 0 ? A[b[l]][1] : 0);
                        help[l][r][c] = 0;
                        suf_help[l][r][c] = A[b[l]][1];
                    }
                }
                continue;
            }

            for (int mid = l; mid < r; mid++) {
                for (int was = 0; was <= k; was++) {
                    for (int will = 0; will + was <= k; will++) {
                        if (was + will + (b[r] != b[l]) <= k) {
                            int nxt = was + will + (b[r] != b[l]);
                            help[l][r][nxt] = min(help[l][r][nxt],
                                                         help[l][mid][was] + dp[mid + 1][r - 1][will]);
                        }
                    }
                }
            }


            for (int mid = l; mid <= r; mid++) {
                for (int was = 0; was <= k; was++) {
                    for (int will = 0; will + was <= k; will++) {
                        suf_help[l][r][was + will] = min(suf_help[l][r][was + will],
                                                         help[l][mid][was] + A[b[l]][mid - l + 1] + dp[mid + 1][r][will]);

                    }
                }
            }
            for (int D = 0; D <= k; D++) {
                if (D >= cnt) dp[l][r][D] = 0;
            }
            for (int mid = l; mid <= r; mid++) {
                for (int was = 0; was <= k; was++) {
                    for (int will = 0; will + was <= k; will++) {
                        dp[l][r][was + will] = min(dp[l][r][was + will],
                                                         suf_help[mid][r][was] + dp[l][mid - 1][will]);

                    }
                }
            }
        }
    }
    for (int i = 0; i <= k; i++) {
        cout << dp[1][n][i] << " ";
    }
    cout << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) solve();
    return 0;
}