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

const int INF = 1e9;

int n, m, k;
vector<int> prizeLocations;
int dist[16][16];

void floydWarshall() {
    for (int k = 0; k < n; ++k)
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}

void solve() {
    cin >> n >> m >> k;
    prizeLocations.resize(k);
    for (int i = 0; i < k; ++i) {
        cin >> prizeLocations[i];
        prizeLocations[i]--;
    }

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            cin >> dist[i][j];

    floydWarshall();

    int maxMask = 1 << n;
    vector<vector<int>> dp(maxMask, vector<int>(n, INF));

    for (int i = 0; i < n; ++i) {
        dp[1 << i][i] = 0;
    }

    for (int mask = 1; mask < maxMask; ++mask) {
        for (int u = 0; u < n; ++u) {
            if (!(mask & (1 << u))) continue;
            for (int v = 0; v < n; ++v) {
                if (mask & (1 << v)) continue;
                int nextMask = mask | (1 << v);
                dp[nextMask][v] = min(dp[nextMask][v], dp[mask][u] + dist[u][v]);
            }
        }
    }

    int res = INF;
    for (int mask = 0; mask < maxMask; ++mask) {
        int stampCount = __builtin_popcount(mask);
        if (stampCount < m) continue;
        for (int prize : prizeLocations) {
            res = min(res, dp[mask][prize]);
        }
    }

    cout << res << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}