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

int main(){
	int N, M, K;
	cin >> N >> M >> K;
	vector<bool> S(N);
	while(K--){
		int a;
		cin >> a;
		S[a - 1] = true;
	}
	vector<vector<int>> T(N, vector<int> (N));
	for(vector<int> &_:T) for(int &t:_) cin >> t;
	vector<vector<int>> dp(1<<N, vector<int> (N, 1e9));
	for(int i = 0; i < N; i++) dp[1 << i][i] = 0;
	int ans = 1e9;
	for(int i = 0; i < 1 << N; i++){
		if(__builtin_popcount(i) >= M){
			for(int j = 0; j < N; j++) if(S[j]) ans = min(ans, dp[i][j]);
			continue;
		}
		for(int j = 0; j < N; j++) if(i >> j & 1)
			for(int k = 0; k < N; k++) if(!(i >> k & 1))
				dp[i | (1<<k)][k] = min(dp[i | (1<<k)][k], dp[i][j] + T[j][k]);
	}
	cout << ans << endl;
	return 0;
}