#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#define EPS 1e-9
#define PI acos(-1.0)
#define ll long long
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
#define pb push_back
#define ft first
#define sc second
#define pi pair<ll,ll>
#define vi vector<ll>
#define sz(s) s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll N = 2e5+5, M = 250, MOD = (1LL<<32), INF = 1e18;
int dx[] = {-1, 1, 0, 0}, Dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};;
int dy[] = {0, 0, 1, -1}, Dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
ll n, m, t, f[M][M][M],a[M];
int dp[M][11][11][11][11];
int solve(int idx,int s,int s2,int p1,int p2)
{
    if(idx == n)
    {
        if(f[p1][p2][s] == a[n-1] && f[p2][s][s2] == a[0])
            return 1;
        return 0;
    }
    int &ret = dp[idx][s][s2][p1][p2];
    if(~ret)
        return ret;
    ret = 0;
    for(int i = 1; i <= m ;++i)
    {
        if(f[p1][p2][i] == a[idx-1])
            ret |= solve(idx+1,s,s2,p2,i);
    }
    return ret;
}
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);//freopen("lines.in", "r", stdin);
    cin >> n >> m;
    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];
    for(int i = 0; i < n ;++i) cin >> a[i];
    memset(dp,-1,sizeof dp);
    int ans = 0;
    for(int i = 1; i <= m ;++i)
        for(int j = 1;j <= m ;++j)
            ans |= solve(2,i,j,i,j);
    cout << (ans?"yes":"no");
    return 0;
}
/*
*/