/// tban lecodes el bosta2
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;
const int N = 2e5+5, LG = 18, MOD = 1e9+7;
const long double PI = acos(-1);
const long double EPS = 1e-7;

int dp[205][10][10][10][10];
int f[10][10][10];
int s[205];
int n, m;
int solve(int index, int fst, int snd, int prv, int prv2) {
    if(index == n) {
        return (f[prv2][prv][fst] == s[n-1])
        && (f[prv][fst][snd] == s[0]);
    }
    int &ret = dp[index][fst][snd][prv][prv2];

    if(~ret)return ret;
    for(int i = 0; i < m; i++) {
        if(f[prv2][prv][i] == s[index - 1] && solve(index + 1, fst, snd, i, prv))
            return ret = 1;
    }

    return ret = 0;
}
void doWork() {

    cin >> n >> m;

    f(i,0,m)
    f(j,0,m)
    f(k,0,m)
    cin >> f[i][j][k], --f[i][j][k];

    f(i,0,n) {
        cin >> s[i];
        --s[i];
    }

    memset(dp,-1,sizeof dp);

    f(i,0,m)
    f(j,0,m)
    if(solve(2,i,j,j,i)) {
        cout << "yes\n";
        return;
    }

    cout << "no\n";
}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}