#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<VL> VVL;
typedef long long LL;
#define all(a) (a).begin(), (a).end()
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define ALL(a)  (a).begin(),(a).end()
#define pb push_back

int p2[21];


int main() {
  p2[0]=1;
  rep(i,20){p2[i+1]=p2[i]*2;}
  int n,m,k;cin>>n>>m>>k;
  set<int> A; int a;
  rep(i,k){cin>>a; A.insert(a-1);}
  int T[n][n];
  rep(i,n)rep(j,n){cin>>T[i][j];}
  map<VI,int> rec;
  queue<VI> D;
  rep(i,n){rec[{p2[i],i,1}]=0; D.push({p2[i],i,1});}
  int ans=-1;
  while(D.size()>0){
    VI z=D.front();D.pop();
    //cout<<z[2]<<endl;
    int kk=rec[z];
    if(z[2]==m){
      if(A.count(z[1])){
        if(ans==-1){ans=kk;}
        else{ans=min(ans,kk);}
      }
      continue;
    }
    rep(i,n){
      if((p2[i]&z[0])==0){
        VI zz={z[0]+p2[i],i,z[2]+1};
        if(rec.count(zz)){rec[zz]=min(rec[zz],kk+T[z[1]][i]);}
        else{rec[zz]=kk+T[z[1]][i];D.push(zz);}
      }
    }
  }  
  cout<<ans<<endl;
}