#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    auto solve = [&]() {
        int n, m;
        cin >> n >> m;

        vector f(m, vector(m, vector<int>(m)));
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < m; j++) {
                for (int k = 0; k < m; k++) {
                    cin >> f[i][j][k];
                    f[i][j][k]--;
                }
            }
        }

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

        for (int x = 0; x < m; x++) {
            for (int y = 0; y < m; y++) {
                vector can(m, vector<int>(m));
                can[x][y] = true;

                for (int rep = 0; rep < n; rep++) {
                    vector ncan(n, vector<int>(m));
                    for (int x = 0; x < m; x++) {
                        for (int y = 0; y < m; y++) {
                            if (!can[x][y]) {
                                continue;
                            }
                            for (int z = 0; z < m; z++) {
                                if (f[x][y][z] == s0[rep]) {
                                    ncan[y][z] = true;
                                }
                            }
                        }
                    }
                    can = move(ncan);
                }

                if (can[x][y]) {
                    cout << "yes\n";
                    return;
                }
            }
        }

        cout << "no\n";
    };

    solve();

    return 0;
}