#include <bits/stdc++.h>

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#endif

#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pi array<int, 2>
// #define comp(v) (sort(all(v)), v.erase(unique(all(v)), v.end()))
#define lb(v, x) (lower_bound(all(v), x) - v.begin())

using namespace std;

#define int long long

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int k, m, n; cin >> k >> m >> n;
    vector<vector<int>> a(m, vector<int>(k));
    for(int i = 0; i < m; ++i){
        for(int j = 0; j < k; ++j){
            cin >> a[i][j]; --a[i][j];
        }
    }

    vector<pi> comp;
    vector<vector<int>> gr(1);
    for(int i = 0; i < m; ++i) gr[0].pb(i);
    mt19937 gen(524);
    uniform_int_distribution<int> uid(0, (int)1e18);
    auto rnd = [&](int l, int r){
        assert(l <= r);
        return uid(gen) % (r - l + 1) + l;
    };
    auto addnew = [&](){
        sort(all(comp));

        pi now;
        int rep = 0;
        while(true){
            ++rep;
            if(rep > 100) return 0;
            now = {rnd(0, k - 1), rnd(0, k - 1)};
            if(now[0] > now[1]) swap(now[0], now[1]);
            if(now[0] == now[1]) continue;
            int p = lb(comp, now);
            if(p < sz(comp) && comp[p] == now) continue;
            break;
        }

        comp.pb(now);
        return 1;
    };
    while(sz(comp) < 60){
        int f = 1;
        for(auto&v:gr) if(sz(v) > 1){
            f = 0;
            break;
        }
        if(f) break;

        assert(addnew());
        auto now = comp.back();

        vector<vector<int>> ngr;
        for(auto&v:gr){
            vector<int> x, y;
            for(auto&id:v){
                if(a[id][now[0]] < a[id][now[1]]) x.pb(id);
                else y.pb(id);
            }
            if(sz(x)) ngr.pb(x);
            if(sz(y)) ngr.pb(y);
        }
        swap(gr, ngr);
    }

    int usecomp = sz(comp) < 60;
    unordered_map<int, int> mp;
    vector<int> pid(m);
    vector<vector<int>> plist;
    // usecomp = 0;
    if(usecomp){
        while(sz(comp) + 1 < 60){
            if(!addnew()) break;
        }
        for(int i = 0; i < m; ++i){
            int bt = 0;
            for(int j = 0; j < sz(comp); ++j){
                if(a[i][comp[j][0]] < a[i][comp[j][1]]){
                    bt |= 1ll << j;
                }
            }
            assert(mp.find(bt) == mp.end());
            // cout << bt << endl;
            mp[bt] = i;
        }
    }
    else{
        assert(k <= 10);
        vector<int> perm(k);
        iota(all(perm), 0ll);
        sort(all(a));
        do{
            plist.pb(perm);
        }while(next_permutation(all(perm)));
        for(int i = 0; i < m; ++i){
            pid[i] = lb(plist, a[i]);
        }
    }

    // cout << "USECOMP " << usecomp << endl;
    // for(auto&v:comp){
    //     cout << v[0] << ' ' << v[1] << endl;
    // }
    // for(int i = 0; i < m; ++i){
    //     cout << pid[i] << endl;
    // }

    vector<int> p(n);
    for(int i = 0; i < n; ++i){
        cin >> p[i];
    }

    int ans = -1;
    for(int i = 0; i + k <= n; ++i){
        if(usecomp){
            int bt = 0;
            for(int j = 0; j < sz(comp); ++j){
                if(p[i + comp[j][0]] < p[i + comp[j][1]]){
                    bt |= 1ll << j;
                }
            }
            if(mp.find(bt) != mp.end()){
                ans = mp[bt];
                break;
            }
        }
        else{
            vector<int> srt(k), now(k);
            for(int j = 0; j < k; ++j){
                srt[j] = now[j] = p[i + j];
            }
            sort(all(srt));
            for(int j = 0; j < k; ++j){
                now[j] = lb(srt, now[j]);
            }
            int sid = lb(plist, now);

            int p = lb(pid, sid);
            if(p < m && pid[p] == sid){
                ans = p;
                break;
            }
        }
    }

    if(ans == -1) cout << 0;
    else{
        for(int i = 0; i < k; ++i){
            cout << a[ans][i] + 1 << ' ';
        }
    }

    return 0;
}