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

using ll = long long;

const ll INF = 1e18;

int main() {
	int N, M, K; cin >> N >> M >> K;
	vector<bool> able(N, false);
	while(K--) {
		int t; cin >> t;
		able[--t] = true;
	}
	ll T[N][N];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) cin >> T[i][j];
	}
	vector dp(1<<N, vector<ll>(N, INF));
	for (int i = 0; i < N; i++) {
		dp[1<<i][i] = 0;
	}
	for (int S = 0; S < (1<<N); S++) {
		for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
			if (dp[S][i] == INF) continue;
			if (S>>j&1) continue;
			dp[1<<j|S][j] = min(dp[1<<j|S][j], dp[S][i] + T[i][j]);
		}
	}
	ll ans = INF;
	for (int S = 0; S < (1<<N); S++) for (int i = 0; i < N; i++) {
		if (popcount((unsigned)S) >= M) {
			for (int j = 0; j < N; j++) {
				if (able[j]) {
					ans = min(ans, dp[S][i] + T[i][j]);
				}
			}
		}
	}
	cout << ans << endl;
}