// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 205, S = 20;

int C, n, m, b[N], a[N][N], s[N], c[N];

struct E{
	int next, v;
} e[1000005];

int numE;

struct Match{
	bool vis[N];
	vector<int> g[N];
	int head[N], cnt[N];
	void inline bf() {
		for (int u = 1; u <= n; u++) {
			int now = 0;
			for (int i = head[u]; i; i = e[i].next) {
				e[++numE] = e[i];
				if (!now) head[u] = numE;
				else e[now].next = numE;
				now = numE;
			}
		}
	}
	bool XFind(int u) {
		for (int v: g[u]) {
			if (vis[v]) continue;
			vis[v] = 1;
			if (cnt[v] < b[v]) {
				return 1;
			} else {
				for (int i = head[v]; i; i = e[i].next) {
					int w = e[i].v;
					if (find(w)) {
						return 1;
					}
				}
			}
		}
		return 0;
	}
	bool find(int u) {
		for (int v: g[u]) {
			if (vis[v]) continue;
			vis[v] = 1;
			if (cnt[v] < b[v]) {
				cnt[v]++;
				e[++numE] = (E) { head[v], u };
				head[v] = numE;
				return 1;
			} else {
				int la = 0;
				for (int i = head[v]; i; i = e[i].next) {
					int w = e[i].v;
					if (find(w)) {
						if (!la) head[v] = e[i].next;
						else e[la].next = e[i].next;
						e[++numE] = (E) { head[v], u };
						head[v] = numE;
						return 1;
					}
					la = i;
				}
			}
		}
		return 0;
	}
	void inline add(int x, int y) {
		g[x].pb(y);
	}
	bool chk(int x) {
		memset(vis, 0, sizeof vis);
		return find(x);
	}
	bool XChk(int x) {
		memset(vis, 0, sizeof vis);
		return XFind(x);
	}
} t[N], cur;

bool inline chk(int p, int x, int v) {
	cur = t[p];
	cur.bf();
	for (int i = 1; i <= m; i++)
		if (a[x][i] && a[x][i] <= v) cur.add(x, i);
	return cur.XChk(x);
}

void inline work1() {
	for (int i = 1; i <= n; i++) {
		int l = 1, r = m + 1;
		while (l < r) {
			int mid = (l + r) >> 1;
			if (chk(i - 1, i, mid)) r = mid;
			else l = mid + 1;
		}
		c[i] = r;
		printf("%d ", r);
		t[i] = t[i - 1];
		t[i].bf();
		if (r <= m) {
			for (int j = 1; j <= m; j++)
				if (a[i][j] == r) t[i].add(i, j);
			t[i].chk(i);
		}	 
	}
	puts("");
}

void inline work2() {
	for (int i = 1; i <= n; i++) {
		int l = 0, r = i;
		while (l < r) {
			int mid = (l + r) >> 1;
			if (chk(i - mid - 1, i, s[i])) r = mid;
			else l = mid + 1;
		}
		printf("%d ", r);
		
	}
	puts("");
	
}

void inline clr() {
	numE = 0;
}

int main() {
	int T; read(T); read(C);
	while (T--) {
		read(n), read(m);
		for (int i = 1; i <= m; i++) read(b[i]);
		for (int i = 1; i <= n; i++) 
			for (int j = 1; j <= m; j++) read(a[i][j]);
		for (int i = 1; i <= n; i++) read(s[i]);
		work1();
		work2();
		clr();
	}
    return 0;
}