#include<bits/stdc++.h>
using namespace std;
#define ERROR ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); fileIO();
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
void fileIO(){
    #ifndef ONLINE_JUDGE
    freopen("io\\input.txt", "r", stdin);
    freopen("io\\output.txt", "w", stdout);
    #endif
}

const ll mod = 1e9 + 7, N = 205, M = 11;
int n, m;
int f[M][M][M];
int a[N];
bool vis[N][M][M][M][M][2], dp[N][M][M][M][M][2];

bool solve(int idx, int prev, int prevprev, int start, int startNxt, bool hasChanged)
{
   if(idx == n)
         return hasChanged;

    auto &ret = dp[idx][prev][prevprev][start][startNxt][hasChanged];
    if(vis[idx][prev][prevprev][start][startNxt][hasChanged])
        return ret;
    vis[idx][prev][prevprev][start][startNxt][hasChanged] = true;
    if(idx != n - 1)
    {
        for(int i = 1; i <= m; i++)
        {
            if(f[prevprev][prev][i] == a[idx - 1])
                ret |= solve(idx + 1, i, prev, start, startNxt, hasChanged | (i != a[idx]));
        }
    }
    else
    {
        for(int i = 1; i <= m; i++)
        {
            if(f[prevprev][prev][i] == a[idx - 1] && f[prev][i][start] == a[idx] && f[i][start][startNxt] == a[0])
                ret |= solve(idx + 1, i, prev, start, startNxt, hasChanged | (i != a[idx]));

        }
    }

    return ret;
}
void TestCase(){
    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];

    bool can = 0;
    for(int i = 1; i <= m; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            for(int k = 1; k <= m; k++)
            {
                if(f[i][j][k] == a[1])
                {

                    // i j k
                    bool hasChanged = (a[0] != i || a[1] != j || a[2] != k);
                    can |= solve(3, k, j, i, j, hasChanged);
                }
            }
        }
    }

    cout << (can ? "yes\n" : "no\n");
    
}

int main() {
    
    ERROR;

    int t = 1;
    //cin >> t;

    while(t--)
        TestCase();

}