#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N, M, K, L;
    cin >> N >> M >> K;
    vector<ll> A(K);
    for (int i=0; i<K; i++){
        cin >> A[i];
        A[i]--;
    }
    vector T(N, vector<ll>(N));
    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++) cin >> T[i][j];
    }
    L = 1<<N;
    vector dp(1<<N, vector<ll>(N, 1e18));
    for (int i=0; i<N; i++){
        dp[1<<i][i] = 0;
    }
    for (int i=0; i<L; i++){
        for (int j=0; j<N; j++){
            if (dp[i][j] == 1e18) continue;
            for (int k=0; k<N; k++){
                if (i>>k & 1) continue;
                dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j]+T[j][k]);
            }
        }
    }
    ll ans=1e18;
    for (int i=0; i<L; i++){
        if (__builtin_popcount(i) < M) continue;
        for (int j=0; j<N; j++){
            for (auto x : A){
                ans = min(ans, dp[i][j]+T[j][x]);
            }
        }
    }
    cout << ans << endl;

    return 0;
}