#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e3 + 5;
int n, m, f[11][11][11], a[N];
int memo[N][11][11][11][11];
int solve(int i, int lst, int cur, int _0, int _n) {
	if(i == n)
		return cur == _0 && lst == _n;
	int &ans = memo[i][lst][cur][_0][_n];
	if(~ans)
		return ans;
	ans = 0;
	for(int nxt = 1;nxt <= m;nxt++) {
		if(f[lst][cur][nxt] == a[i])
			ans = max(ans, solve(i + 1, cur, nxt, _0, _n));
	}
	return ans;
}
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    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(memo, -1, sizeof memo);
	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[0] && solve(1, j, k, j, i))
					return cout << "yes", 0;
 			}
		}
	}
	cout << "no";
    return 0;
}