#include <bits/stdc++.h>
#define endl "\n"
using namespace std;

namespace std {

template <int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
    static_assert(D >= 1);
    template <typename... Args>
    Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};

template <typename T>
struct Vec<1, T> : public vector<T> {
    Vec(int n = 0, T val = T()) : std::vector<T>(n, val) {}
};

template <class Fun>
class y_combinator_result {
    Fun fun_;

   public:
    template <class T>
    explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

    template <class... Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

}  // namespace std

const long long base = 1e5 + 1;

const long long mod[3] = {(long long) 1e9 + 7, (long long) 1e9 + 9, (long long) 1e9 + 10};

void solve() {
    int k, m, n; cin >> k >> m >> n;

    Vec<2, int> a(m, k);

    map<long long, int> mp;

    for (int i = 0; i < m; i++) {
        vector<long long> hs(2);
        for (int j = 0; j < k; j++) {
            cin >> a[i][j];
            for (int l = 0; l < 2; l++) {
                hs[l] = (hs[l] * base + a[i][j]) % mod[l];
            }
        }
        long long code = hs[0] * mod[3] + hs[1];
        assert(mp[code] == 0);
        mp[code] = i + 1;
    }

    vector<int> b(n);

    for (int i = 0; i < n; i++) {
        cin >> b[i];
        if (i >= k - 1) {
            vector<int> rrh, arr;
            for (int j = i - k + 1; j <= i; j++) {
                arr.push_back(b[j]);
                rrh.push_back(b[j]);
            }

            sort(rrh.begin(), rrh.end());
            rrh.resize(unique(rrh.begin(), rrh.end()) - rrh.begin());

            vector<long long> hs(2);

            for (auto &j : arr) {
                j = upper_bound(rrh.begin(), rrh.end(), j) - rrh.begin();
                for (int l = 0; l < 2; l++) {
                    hs[l] = (hs[l] * base + j) % mod[l];
                }
            }

            long long code = hs[0] * mod[3] + hs[1];

            if (mp[code]) {
                int idx = mp[code] - 1;
                for (int j = 0; j < k; j++) cout << a[idx][j] << " ";
                exit(0);
            }
        }
    }

    cout << 0;
}


int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    // ?cin >> t; 

    while (t--) {
        solve();
        cout << endl;
    }
}