#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;

int N,M,K;
vl A;
vvl T;

int main(){
    cin >> N >> M >> K;
    A.resize(K);
    for (int i = 0; i < K; i++){
        cin >> A[i];
        A[i]--; 
    }
    T.resize(N, vl(N));
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++){
            cin >> T[i][j];
        }
    }

    vector<bool> in_A(N, false);
    for (int a : A){
        in_A[a] = true;
    }

    // 最近傍の景品
    vl nearlest(N);
    for (int i=0; i < N; i++){
        ll min = LLONG_MAX;
        for (int a : A){
            if (T[i][a] < min){
                min = T[i][a];
                nearlest[i] = a;
            }
        }
    }

    priority_queue<tuple<ll, int, int, int>, vector<tuple<ll,int,int,int>>,greater<tuple<ll, int, int, int>>> pq;
    for (int i=0; i < N; i++){
        pq.emplace(0,i,1 << i, 1);
    }
    while(!pq.empty()){
        auto [d, pos, bit, cnt] = pq.top();
        pq.pop();
        if (cnt == M){
            if (in_A[pos]){
                cout << d << endl;
                return 0;
            }
            else{
                pq.emplace(d, nearlest[pos], bit | (1 << nearlest[pos]), cnt);
            }
            continue;
        }
        for (int i=0; i < N; i++){
            if (bit & (1 << i)) continue;
            pq.emplace(d + T[pos][i], i, bit | (1 << i), cnt + 1);
        }
    }
}