#include <bits/stdc++.h>

#define ll long long
using namespace std;

const int N = 2e2 + 5, M = 15;

int n, m;
int f[M][M][M], s[N];
vector<tuple<int,int,int>>inv[M];

int lst, frst, id;
int dp[N][M][M], vis[N][M][M];
int solve(int i, int prv, int force)
{
    if(i == n - 1)
    {
        if(force != lst)
            return 0;

        for(auto& [a,b,c] : inv[s[i]])
        {
            if(a != prv || b != force)
                continue;
            if(c == frst)
                return 1;
        }
        return 0;
    }

    int& ret = dp[i][prv][force];
    if(vis[i][prv][force] == id)
        return ret;

    ret = 0, vis[i][prv][force] = id;

    for(auto& [a,b,c] : inv[s[i]])
    {
        if(a != prv || b != force)
            continue;
        ret = max(ret, solve(i + 1, b, c));
    }

    return ret;
}
void tc()
{
    cin >> n >> m;
    for(int a = 1; a <= m; a++)
        for(int b = 1; b <= m; b++)
            for(int c = 1; c <= m; c++)
                cin >> f[a][b][c], inv[f[a][b][c]].emplace_back(a, b, c);

    for(int i= 0; i < n; i++)
        cin >> s[i];

    id++;
    for(auto& [a, b, c] : inv[s[0]])
    {
        lst = a, frst = b;
        if(solve(1, b, c))
            return cout << "yes", void();
    }
    cout << "no";
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;

//    cin >> t;

    while (t--) {
        tc();
    }

    return 0;
}