#include <bits/stdc++.h>
#define sz(x) ((x).size())
using namespace std;
typedef long long ll;
int main(){
    int n, m;
    cin >> n >> m;
    int f[11][11][11];
    for (int i = 1; i <= m; ++i)
        for (int j = 1; j <= m; ++j)
            for (int k = 1; k <= m; ++k)
                cin >> f[i][j][k];
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    for (int s1 = 1; s1 <= m; ++s1)
        for (int s2 = 1; s2 <= m; ++s2) {
            vector<vector<vector<int>>> dp(n + 1, vector<vector<int>>(m + 1, vector<int>(m + 1)));
            dp[2][s1][s2] = true;
            for (int i = 3; i <= n; ++i)
                for (int x = 1; x <= m; ++x)
                    for (int y = 1; y <= m; ++y)
                        for (int z = 1; z <= m; ++z)
                            if (f[x][y][z] == a[i - 1])
                                dp[i][y][z] |= dp[i - 1][x][y];
            for (int y = 1; y <= m; ++y)
                for (int z = 1; z <= m; ++z)
                    if (dp[n][y][z]) {
                        // cout << s1 << ',' << s2 << ' ' << y << ' ' << z << endl;
                        if (f[y][z][s1] == a[n] && f[z][s1][s2] == a[1]) {
                            puts("yes");
                            return 0;
                        }
                    }
        }
    puts("no");
}