#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
using LL = long long;

const int maxn = 405, maxm = 6005;
struct Flow{

    int n, m, idx;
    int h[maxn], f[maxm], e[maxm];
    int d[maxn], pre[maxn], ne[maxn];
    vector<pair<int *, int> > ops;

    Flow() : n(0) {}

    void init(int _n, int _m){
        n = _n, m = _m;
        for(int i = 0; i <= n + m; i++){
            h[i] = -1;
        }
        idx = 0;
        ops.clear();
    }

    void add(int a, int b, int c){
        ops.push_back({&h[a], h[a]});
        ops.push_back({&h[b], h[b]});
        e[idx] = b, f[idx] = c, ne[idx] = h[a], h[a] = idx++;
        e[idx] = a, f[idx] = 0, ne[idx] = h[b], h[b] = idx++;
    }

    void undo(int ver){
        while(ops.size() > ver){
            auto [x, y] = ops.back();
            ops.pop_back();
            *x = y;
            idx -= 1;
        }
    }

    bool bfs(int st, bool type){
        for(int i = 0; i <= n + m; i++) d[i] = -1;
        queue<int> q;
        d[st] = 0;
        q.push(st);
        while(!q.empty()){
            int t = q.front();
            q.pop();
            for(int i = h[t]; ~i; i = ne[i]){
                int j = e[i];
                if (f[i] and d[j] == -1){
                    d[j] = d[t] + 1;
                    pre[j] = i;
                    q.push(j);
                }
            }
        }
        if (d[0] != -1){
            if (type){
                int t = 0;
                while(t != st){
                    f[pre[t]] -= 1;
                    f[pre[t] ^ 1] += 1;
                    t = e[pre[t] ^ 1];
                }
            }
            return true;
        }
        return false;
    }

}f[201];

vector<int> pos[205][205];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T, C;
    cin >> T >> C;
    while(T--){
        int n, m;
        cin >> n >> m;
        f[0].init(n, m);
        for(int i = 1; i <= m; i++){
            int x;
            cin >> x;
            f[0].add(n + i, 0, x);
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= m; j++){
                pos[i][j].clear();
            }
        }
        vector<int> ans1(n + 1, m + 1);
        vector<int> ans2(n + 1);
        for(int i = 1; i <= n; i++){
            f[i] = f[i - 1];
            for(int j = 1; j <= m; j++){
                int x;
                cin >> x;
                pos[i][x].push_back(j);
            }
            for(int j = 1; j <= m; j++){
                if (pos[i][j].empty()) continue;
                int bk = f[i].ops.size();
                for(auto x : pos[i][j]){
                    f[i].add(i, n + x, 1);
                }
                if (f[i].bfs(i, true)){
                    ans1[i] = j;
                    break;
                }
                f[i].undo(bk);
            }
        }
        for(int i = 1; i <= n; i++){
            int x;
            cin >> x;
            if (ans1[i] <= x){
                ans2[i] = 0;
                continue;
            }

            auto check = [&](int mid){
                int bk = f[mid - 1].ops.size();
                for(int j = 1; j <= x; j++){
                    for(auto y : pos[i][j]){
                        f[mid - 1].add(i, n + y, 1);
                    }
                }
                bool ret = f[mid - 1].bfs(i, false);
                f[mid - 1].undo(bk);
                return ret;
            };

            int l = 0, r = i;
            while(l < r){
                int mid = (l + r + 1) / 2;
                if (check(mid)) l = mid;
                else r = mid - 1;
            }
            ans2[i] = i - r;
        }
        for(int i = 1; i <= n; i++){
            cout << ans1[i] << " \n"[i == n];
        }
        for(int i = 1; i <= n; i++){
            cout << ans2[i] << " \n"[i == n];
        }    
    }

}