#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

const ll base=41597, Mod=100000004987;
ll po[1000005], a[1000005];
map <ll, int> trace;
vector <int> tick[1005];

namespace SegTree
{
    struct Node
    {
        int cnt=0;
        ll val=0;
        Node(){}
        Node(int x): cnt(!!x), val(x){}
        Node operator + (const Node &a) const
        {
            Node ans;
            ans.cnt=cnt+a.cnt;
            ans.val=(val+(__int128_t)1*a.val*po[cnt])%Mod;
            return ans;
        }
    };

    int n;
    Node St[4000005];
    void init(int sz) {n=sz;}

    void update(int i, int Start, int End, int idx, int val)
    {
        if (Start==End) {St[i]=Node(val); return;}
        int mid=(Start+End)/2;
        if (idx<=mid) update(i*2, Start, mid, idx, val);
        else update(i*2+1, mid+1, End, idx, val); 
        St[i]=St[i*2]+St[i*2+1];
    }

    void update(int idx, int val) {update(1, 1, n, idx, val);}
    ll query() {return St[1].val;}
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int k, m, n; cin >> k >> m >> n;
    long long sum=0; 
    for (int i=0; i<=n; i++)
    {
        po[i]=i?po[i-1]*base%Mod:1;
        if (i<k) sum=(sum+po[i])%Mod;
    }
    for (int i=1; i<=m; i++)
    {
        tick[i].resize(k);
        vector <pair<int, int>> num;
        for (int j=0; j<k; j++)
            cin >> tick[i][j], num.pb({tick[i][j], j+1});
        sort(num.begin(), num.end());
        ll val=0;
        for (int j=0; j<k; j++)
            val=(val+(__int128_t)1*po[j]*num[j].se)%Mod;
        trace[val]=i;
    }
    vector <int> num;
    for (int i=1; i<=n; i++) cin >> a[i], num.pb(a[i]);
    sort(num.begin(), num.end());
    num.resize(unique(num.begin(), num.end())-num.begin());
    SegTree::init(n);
    for (int i=1; i<=n; i++)
    {
        a[i]=lower_bound(num.begin(), num.end(), a[i])-num.begin()+1;
        SegTree::update(a[i], i);
        if (i>=k)
        {
            ll val=(SegTree::query()-sum*(i-k)%Mod+Mod)%Mod;
            if (trace[val])
            {
                int id=trace[val];
                for (int j:tick[id]) cout << j << " ";
                exit(0);
            }
            SegTree::update(a[i-k+1], 0);
        }   
    }
    cout << 0;
}