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

using namespace std;
using ll = long long;

mt19937 rnd(time(nullptr));

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

int n, m, s[N], f[M][M][M], dp[N][M][M][M][M];

int solve(int i, int x, int y, int y0, int y1) {
    
    auto &me = dp[i][x][y][y0][y1];
    if (~me)
        return me;
    
    if (i == n + 1)
        return me = x == y0 && y == y1;
    
    me = 0;
    for (int z = 0; z < m; ++z)
        if (f[x][y][z] == s[i % n])
            me |= solve(i + 1, y, z, y0, y1);
    
    return me;
    
}

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 y0 = 0; y0 < m; ++y0)
        for (int y1 = 0; y1 < m; ++y1)
            if (solve(1, y0, y1, y0, y1))
                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);
    memset(dp, -1, sizeof dp);
    
}

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