#include <iostream>
#include <cstdio>
#include <ext/pb_ds/priority_queue.hpp>
#define N 500000
#define pa pair<int,int>
using namespace std;
using namespace __gnu_pbds;
bool vis[N];
int n,p,h,cnt,fx[5]={1,-1,0,0},fy[5]={0,0,-1,1},mp[55][55],harm[2505],to[N<<1],far[N],val[N<<1],head[N<<1],nextt[N<<1];
typedef __gnu_pbds::priority_queue<pa,greater<pa>,pairing_heap_tag>heap;
heap::point_iterator id[N];
inline void ins(int u,int v,int w)
{nextt[++cnt]=head[u];to[cnt]=v;val[cnt]=w;head[u]=cnt;
}
void dijkstra()
{heap q;for(int i=0;i<=n*n+1;++i) vis[i]=false,far[i]=0x3f3f3f3f;far[0]=0;id[0]=q.push(make_pair(0,0));for(int u;!q.empty();){u=q.top().second;q.pop();if(vis[u]) continue;vis[u]=true;for(int i=head[u];i;i=nextt[i]){int v=to[i];if(far[v]>far[u]+val[i]){far[v]=far[u]+val[i];val[i]=0;if(id[v]!=0) q.modify(id[v],make_pair(far[v],v));else id[v]=q.push(make_pair(far[v],v));}}}
}
int Main()
{freopen("eldrethalas.in","r",stdin);freopen("eldrethalas.out","w",stdout);scanf("%d%d%d",&n,&p,&h);for(int i=1;i<=p;++i) scanf("%d",&harm[i]);for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)scanf("%d",&mp[i][j]);for(int a=1;a<=n;++a)for(int b=1;b<=n;++b)for(int c=1;c<=n;++c)for(int d=1;d<=n;++d)if(mp[a][b]==mp[c][d]&&a!=c&&b!=d) ins((a-1)*n+b,(c-1)*n+d,0);for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)for(int k=0;k<4;++k){int ti=i+fx[k],tj=j+fy[k];if(ti<1||ti>n||tj<1||tj>n||mp[i][j]==mp[ti][tj]) continue;ins((i-1)*n+j,(ti-1)*n+tj,harm[mp[ti][tj]]);}for(int i=1;i<=n;++i) ins(0,i,harm[mp[1][i]]),ins(i,0,harm[mp[1][i]]);for(int i=(n-1)*n+1;i<=n*n;++i) ins(i,n*n+1,0),ins(n*n+1,i,0);dijkstra();if(far[n*n+1]!=0x3f3f3f3f&&h-far[n*n+1]>0) printf("%d\n",h-far[n*n+1]);else puts("NO");return 0;
}
int sb=Main();
int main(int argc,char *argv[]){;}