#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
const int MAXSIZE = 1 << 22;
const int MAXN=1002;
inline char gc()
{static char In[MAXSIZE], *at = In, *en = In;if (at == en){en = (at = In) + fread(In, 1, MAXSIZE, stdin);}return at == en ? EOF : *at++;
}
inline long long Read()
{char c;while (c = gc(), !(c >= '0'&&c <= '9') && c != '-') {}bool f = c == '-';long long x = f ? 0 : c - '0';for (c = gc(); c >= '0'&&c <= '9'; c = gc()){x = x * 10 + c - '0';}return f ? -x : x;
}
int n,m;
int Map[MAXN][MAXN];
int ReMap[MAXN][MAXN];
bool Mark[MAXN];
int A[MAXN];
int B[MAXN];
int EdgeIn[MAXN];
int Q_A[MAXN];
int lenA;
int Q_B[MAXN];
int lenB;
int Position[MAXN];
int Lis[MAXN];
int ans;
bool Circle_Being;
void ToplogicalSort_A(){memset(Mark,0,sizeof(Mark));queue<int>q;for(int i=1;i<=m;i++){if(!EdgeIn[A[i]]){q.push(A[i]); }}while(!q.empty()){int First=q.front();q.pop();Mark[First]=true;Q_A[++lenA]=First;for(int i=1;i<=m;i++){if(ReMap[First][A[i]]){ReMap[First][A[i]]=0;EdgeIn[A[i]]--;if(!EdgeIn[A[i]]){q.push(A[i]);}}}}if(lenA<m){//cout<<"A has circle"<<endl;Circle_Being=true;return ;}
}
void ToplogicalSort_B(){memset(Mark,0,sizeof(Mark));queue<int>q;for(int i=1;i<=B[0];i++){if(!EdgeIn[B[i]]){q.push(B[i]);}}while(!q.empty()){int First=q.front();q.pop();Mark[First]=true;Q_B[++lenB]=First;for(int i=1;i<=B[0];i++){if(ReMap[First][B[i]]){ReMap[First][B[i]]=0;EdgeIn[B[i]]--;if(!EdgeIn[B[i]]){q.push(B[i]);}}}}if(lenB<B[0]){//cout<<"B has circle"<<endl;Circle_Being=true;}
}
int main(){n=Read();m=Read();for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){Map[i][j]=Read();ReMap[i][j]=Map[i][j];}}for(int i=1;i<=m;i++){A[i]=Read();Mark[A[i]]=true;}for(int i=1;i<=m;i++){for(int j=1;j<=m;j++){if(Map[A[i]][A[j]]){EdgeIn[A[j]]++;}}}for(int i=1;i<=n;i++){if(!Mark[i]){B[++B[0]]=i;}}for(int i=1;i<=B[0];i++){for(int j=1;j<=B[0];j++){if(Map[B[i]][B[j]]){EdgeIn[B[j]]++;}}}ToplogicalSort_A();ToplogicalSort_B();if(Circle_Being){printf("NO");return 0;}printf("YES ");//截止这里，就已经实现了用拓补排序判断是否存在环的情况。for(int j=1;j<=B[0];j++){Lis[j]=1;int i=1;while(Map[Q_A[i]][Q_B[j]]&&i<=m){i++;}Position[j]=i;bool Insert=false;for(int k=i;k<=m;k++){if(Map[Q_A[k]][Q_B[j]]){Insert=true;break;}}if(Insert){Position[j]=0;}}for(int i=1;i<=B[0];i++){if(!Position[i]){continue;}for(int j=1;j<i;j++){if(Position[j]<=Position[i]&&Position[j]){Lis[i]=max(Lis[i],Lis[j]+1);}}}for(int i=1;i<=B[0];i++){ans=max(ans,Lis[i]);}printf("%d",ans);
}