#include <bits/stdc++.h>
using namespace std;
const int M = 100005, N = 505;
int TT, C, h[N], ne[M], w[M], s[N], e[M], d[N], cur[N], n, m, a[N], b[N][N], cnt, id[N];
void add(int x, int y, int c){
	ne[++cnt] = h[x], h[x] = cnt, e[cnt] = y, w[cnt] = c;
	ne[++cnt] = h[y], h[y] = cnt, e[cnt] = x, w[cnt] = 0;
}
int bfs(int s, int t){
	queue <int> q; memset(d, -1, sizeof d);
	q.push(s), d[s] = 0;
	while(!q.empty()){
		int t = q.front(); q.pop();
		for(int i = cur[t] = h[t]; ~i; i = ne[i]) if(w[i] && !~d[e[i]])
			q.push(e[i]), d[e[i]] = d[t] + 1;
	}
	return d[t];
}
int find(int x, int mf, int T){
	if(x == T) return mf;
	int flow = 0;
	for(int &i = cur[x]; ~i; i = ne[i]){
		if(flow == mf) break;
		if(!w[i] || d[e[i]] != d[x] + 1) continue;
		int t = find(e[i], min(mf - flow, w[i]), T);
		flow += t, w[i] -= t, w[i ^ 1] += t;
	}
	return flow;
}
int dinic(int S, int T){
	int ans = 0;
	while(~bfs(S, T)) ans += find(S, 114514, T);
	return ans;
}
int mch[N][N], S, T;
vector <int> v[N][N];
void rec(int x){
	memset(h, -1, sizeof h), cnt = -1;
	for(int i = 1; i <= n; i++) add(S, i, 1), w[cnt ^ 1] = (i > x);
	for(int i = 1; i <= m; i++) add(i + n, T, a[i]), id[i] = cnt - 1;
	for(int i = 1; i <= x; i++)
		for(int j: v[i][b[i][mch[x][i]]]){
			add(i, j + n, 1);
			if(j == mch[x][i]) swap(w[cnt], w[cnt ^ 1]), w[id[j]]--;
		}
}
int chk(int i, int h){
	rec(i - 1);
	for(int j = 1; j <= m; j++) if(b[i][j] <= h && b[i][j]) add(i, j + n, 1);
	return dinic(S, T);
}
int chk2(int i, int h){
	if(h == i) return 1;
	rec(i - h - 1);
	for(int j = 1; j <= m; j++) if(b[i][j] <= s[i] && b[i][j]) add(i, j + n, 1);
	return dinic(S, T);
}
int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> TT >> C;
	while(TT--){
		cin >> n >> m;
		S = 0, T = n + m + 2;
		for(int i = 1; i <= m; i++) cin >> a[i];
		for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cin >> b[i][j], v[i][j].clear(), v[i][m + 1].clear();
		for(int i = 1; i <= n; i++) cin >> s[i];
		m++;
		for(int i = 1; i <= n; i++) b[i][m] = m; a[m] = n;
		for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) v[i][b[i][j]].push_back(j);
		for(int i = 1; i <= n; i++){
			int l = 1, r = m;
			while(l < r){
				int mid = l + r >> 1;
				if(chk(i, mid)) r = mid;
				else l = mid + 1;
			}
			chk(i, l);
			cout << l << ' ';
			for(int j = 1; j <= i; j++)
				for(int k = h[j]; ~k; k = ne[k])
					if(!w[k] && e[k]) mch[i][j] = e[k] - n;
		}
		cout << '\n';
		for(int i = 1; i <= n; i++){
			int l = 0, r = i;
			while(l < r){
				int mid = l + r >> 1;
				if(chk2(i, mid)) r = mid;
				else l = mid + 1;
			}
			cout << l << ' ';
		}
		cout << '\n';
	}
	return 0;
}