#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

using mint = modint998244353;

ll gcd(ll a, ll b){
    if(a%b == 0){
      return b;
    }else{
      return gcd(b, a%b);
    }
}

ll lcm(ll a, ll b){
    return a*b / gcd(a, b);
}

ll powMod(ll x, ll n) {
    if (n == 0) return 1 % MOD;
    ll val = powMod(x, n / 2);
    val *= val;
    val %= MOD;
    if (n % 2 == 1) val *= x;
    return val % MOD;
}

int main() {
    ll n, m, k; cin >> n >> m >> k;
    vector<ll> a(n);
    rep(i,0,k) cin >> a[i], a[i]--;
    vector<vector<ll>> t(n, vector<ll>(n));
    rep(i,0,n)rep(j,0,n) cin >> t[i][j];
    vector<ll> vec(m+1);
    ll ans = INF;
    auto dfs = [&](auto dfs, ll now, ll mask) -> void {
        if(now == m+1){
            ll cnt = 0;
            rep(i,0,m) cnt += t[vec[i]][vec[i+1]];
            chmin(ans,cnt);
            return;
        }
        rep(i,0,n){
            if(mask >> i & 1) continue;
            vec[now] = i;
            dfs(dfs,now+1,mask^(1LL<<i));
        }
    };
    rep(i,0,k){
        vec[0] = a[i];
        dfs(dfs,1,0);
    }
    cout << ans << endl;
    return 0;
}