#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for (int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int, k>
template<class A, class B> void cmx(A &x, B y) { x = max<A>(x, y);}
template<class A, class B> void cmn(A &x, B y) { x = min<A>(x, y);}
typedef pair<int, int> pii;
typedef vector<int> vi;
int n,m,g[20][20][20],f[209][11][11],b[209];
void C(int p,int q){
	memset(f,0,sizeof f),f[2][p][q]=1;
	for(int i=3;i<=n;i++)
		for(int j=1;j<=m;j++)
			for(int k=1;k<=m;k++)
				for(int l=1;l<=m;l++)
					if(f[i-1][j][k]&&g[j][k][l]==b[i-1])
						f[i][k][l]=1;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			if(f[n][i][j]&&g[i][j][p]==b[n]&&g[j][p][q]==b[1])
				cout<<"yes\n",exit(0);
}
signed main() {
	//cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
	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>>g[i][j][k];
	for(int i=1;i<=n;i++)
		cin>>b[i];
	for(int i=1;i<=m;i++)
		for(int j=1;j<=m;j++)
			C(i,j);
	cout<<"no\n";
}