#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
int inf = 1e9;

int main(){
    int n, m, k; cin >> n >> m >> k;
    vi a(k); rep(i, k){
        cin >> a[i];
        a[i]--;
    }
    vvi t(n, vi(n));
    rep(i, n)rep(j, n)cin >> t[i][j];
    vi b(n, inf);
    rep(i, n){
        rep(j, k){
            b[i] = min(b[i], t[i][a[j]]);
        }
    }
    vi d(n, 0); rep(i, m)d[n-1-i] = 1;
    int ans = inf;
    do{
        
        vi v;rep(i, n){
            if(d[i])v.push_back(i);
        }
        int tmp = inf;
        do{
            int tmp2 = 0;
            rep(j, m-1){
                tmp2 += t[v[j]][v[j+1]];
            }
            tmp = min(tmp, tmp2 + b[v[m-1]]);
        }while(next_permutation(all(v)));
        ans = min(ans, tmp);
    }while(next_permutation(all(d)));
    cout << ans << endl;
    return 0;
}