#include <iostream>
#include <algorithm>
using namespace std;
int n;


int main() {
  int n, i, j,k,q,m,S=11111111;
  int o[n+1];
  cin >> n >> m;
  int a[n+2];
  int b[n+1][n+1];

  for (int i = 0; i <= n; i++)
      for (int j = 0; j <=n; j++)
        cin >> b[i][j];

  for  (i = 1; i <= n; i++)
  {
    cin >> a[i];
  }
  a[0]=m;
  a[n+1] = m;
  while ((i!=0)||(j!=0))
   {

  i = n;
  j = n;
  while ((a[i] < a[i-1]))
    i--;
  if (i > 1)
  {
    while (a[j] < a[i-1])
      j--;
    swap(a[i-1], a[j]);
    j = n;
    while (i < j)
    {
      swap(a[i], a[j]);
      i++;
      j--;
    }

  }
  else break;
  q=0;
  k=0;
  while (q<n+1)
  {
    i=a[q];
    j=a[q+1];
    k=k+b[i][j];
    q++;
  }
 if (S>k)
 S=k;
}
cout << S;

  return 0;
}