#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxl 200+10

#define maxn 1000+10

#define INF 2147483647

using namespace std;

inline int read()

{

    int x=;

    bool f=;

    char c=getchar();

    for(; !isdigit(c); c=getchar()) if(c=='-') f=;

    for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

    if(f) return x;

    return -x;

}

inline void write(int x)

{

    if(x<){putchar('-');x=-x;}

    if(x>)write(x/);

    putchar(x%+'');

}

int l,n;

int c[maxl][maxl],p[maxn],dp[maxn][maxl][maxl];

signed main()

{

    memset(dp,,sizeof(dp));

    l=read();n=read();

    for(int i=;i<=l;i++)

        for(int j=;j<=l;j++)

            c[i][j]=read();

    for(int i=;i<=n;i++) p[i]=read();

    dp[][][]=;

    p[]=;

    for(int i=;i<=n-;i++)

        for(int x=;x<=l;x++)

            for(int y=;y<=l;y++)

            {

                if(x==y||x==p[i]||y==p[i]) continue;

                dp[i+][x][y]=min(dp[i+][x][y],dp[i][x][y]+c[p[i]][p[i+]]);

                dp[i+][p[i]][y]=min(dp[i+][p[i]][y],dp[i][x][y]+c[x][p[i+]]);

                dp[i+][x][p[i]]=min(dp[i+][x][p[i]],dp[i][x][y]+c[y][p[i+]]);

            }

    int ans=INF;

    for(int i=;i<=l;i++)

        for(int j=;j<=l;j++)

            ans=min(ans,dp[n][i][j]);

    write(ans);

    return ;

}