#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ins insert
#define pq priority_queue
#define minele min_element
#define maxele max_element
#define lb lower_bound //first pos >= val
#define ub upper_bound // first pos > val
#define cnt_bit __builtin_popcount
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;


int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

const ll oo = 1e18;
const ll maxN = 1e6;

/* Author : Le Ngoc Bao Anh, 10A5, LQD High School for Gifted Student */

void maximize(int &a, int b) {
    a = max(a, b);
}

void minimize(int &a, int b) {
    a = min(a, b);
}

struct Rows {
    int values[105];
    int id;
} a[10010];
int id[maxN];

void solve() {
    int n, m, p; cin >> n >> m >> p;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cin >> a[i].values[j];
        }
        a[i].id = i;
    }

    for(int i = 1; i <= p; i++) {
        int x; cin >> x;
        id[x] = i;
    }

    vector<int> q;
    for(int i = 1; i <= m; i++) if(id[i]) q.pb(i);

    sort(q.begin(), q.end(), [&](int _a, int _b) {return id[_a] < id[_b];});
    for(int i = 0; i < q.size(); i++) {
        int x = q[i];
        sort(a + 1, a + 1 + n, [&](Rows _a, Rows _b) {if(_a.values[x] == _b.values[x]) return _a.id < _b.id; return _a.values[x] < _b.values[x];});
        for(int j = 1; j <= n; j++) a[j].id = j;
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            cout << a[i].values[j] << " ";
        }

        cout << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}