#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
    r=0;bool w=0;char ch=getchar();
    while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
    while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
    return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
    int s=1;
    while(y){
        if(y&1)s=1ll*s*x%mod;
        x=1ll*x*x%mod;
        y>>=1;
    }
    return s;
}
const int N=110;
const int K=11;
int n,m;
int a[N],b[N];
int A[N][N];
int f[N][N][K],g[N][N][K],dp[N][K];
void solve(){
    memset(f,0x3f,sizeof(f));
    memset(g,0x3f,sizeof(g));
    memset(dp,0x3f,sizeof(dp));
    read(n,m);
    for(int i=1;i<=n;i++)read(a[i]);
    for(int i=1;i<=n;i++)read(b[i]);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            read(A[i][j]);
    for(int i=1;i<=n;i++){
        f[i][i][1]=0;
        f[i][i][0]=A[b[i]][1];
        g[i][i][0]=0;
    }
    for(int len=2;len<=n;len++)
        for(int i=1;i+len-1<=n;i++){
            int j=i+len-1;
            if(b[i]==b[j]){
                for(int k=0;k<=m;k++)g[i][j][k]=g[i][j-1][k];
            }
            else{
                for(int k=1;k<=m;k++)g[i][j][k]=g[i][j-1][k-1];
            }
            for(int k=i;k<j;k++)
                for(int p=0;p<=m;p++)
                    for(int q=0;p+q<=m;q++){
                        cmin(g[i][j][p+q],g[i][k][p]+f[k+1][j][q]);
                        cmin(f[i][j][p+q],f[i][k][p]+f[k+1][j][q]);
                    }
            for(int k=0;k<=m;k++)
                cmin(f[i][j][k],g[i][j][k]+A[b[i]][len]);
        }
    dp[0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=m;j++){
            if(a[i]==b[i])dp[i][j]=dp[i-1][j];
            else if(j)dp[i][j]=dp[i-1][j-1];
        }
        for(int j=i;j>=1;j--){
            for(int p=0;p<=m;p++)
                for(int q=0;p+q<=m;q++){
                    cmin(dp[i][p+q],dp[j-1][p]+f[j][i][q]);
                }
        }
    }
    for(int i=1;i<=m;i++)cmin(dp[n][i],dp[n][i-1]);
    for(int i=0;i<=m;i++)cout << dp[n][i] << ' ';
    puts("");
}
signed main(){
    #ifdef do_while_true
//        assert(freopen("data.in","r",stdin));
//        assert(freopen("data.out","w",stdout));
    #endif
    int T;read(T);
    while(T--)solve();
    #ifdef do_while_true
//        cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
    #endif
    return 0;
}