// Hey there.. I love you <3
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

mt19937 rnd(time(nullptr));

const int N = 2e2 + 5, M = 11, mod = 1e9 + 7;
const double pi = acos(-1), eps = 1e-10;

int n, m, s[N], f[M][M][M], vis[N * M * M];

vector<int> adj[N * M * M];

bool dfs(int u, int c) {
    
    if (c > n) return false;
    if (vis[u]) return true;
    vis[u] = 1;
    
    for (auto v: adj[u])
        if (dfs(v, c + 1))
            return true;
    
    return false;
}

void work() {
    
    cin >> n >> 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];
    
    for (int i = 0; i < n; ++i)
        cin >> s[i], --s[i];
    
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < m; ++j)
            for (int k = 0; k < m; ++k)
                for (int l = 0; l < m; ++l) {
                    if (f[j][k][l] == s[i])
                        adj[i * 100 + j * 10 + k].push_back((i + 1) % n * 100 + k * 10 + l);
                }
    
    for (int j = 0; j < m; ++j)
        for (int k = 0; k < m; ++k) {
            int u = 10 * j + k;
            memset(vis, 0, sizeof vis);
            if (dfs(u, 0))
                return void(cout << "yes" << endl);
        }
    
    cout << "no" << endl;
    
    
}


void init() {
    cin.tie(nullptr);
    istream::sync_with_stdio(false);
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);


}

int main() {
    init();
    
    int testCases = 1;
//    cin >> testCases;
    while (testCases--) work();
    
    return 0;
}