#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#ifdef _MSC_VER
#define __builtin_popcount (int)__popcnt
#define __builtin_popcountll (int)__popcnt64
inline int __builtin_ctz(unsigned int n) { unsigned long i; _BitScanForward(&i, n); return i; }
inline int __builtin_ctzll(unsigned long long n) { unsigned long i; _BitScanForward64(&i, n); return i; }
inline int __builtin_clz(unsigned int n) { unsigned long i; _BitScanReverse(&i, n); return i; }
inline int __builtin_clzll(unsigned long long n) { unsigned long i; _BitScanReverse64(&i, n); return i; }
#endif
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector<int>a(n);
	rep(i, k) {
		int x; cin >> x;
		a[x - 1] = 1;
	}
	vector t(n, vector<int>(n));
	rep(i, n)rep(j, n)cin >> t[i][j];
	vector dp(1 << n, vector<int>(n, INF));
	rep(i, n)dp[1 << i][i] = 0;
	rep(i, (1 << n))rep(j, n) {
		if (dp[i][j] == INF)continue;
		rep(nj, n) {
			if (1 & (i >> nj))continue;
			int ni = i + (1 << nj);
			chmin(dp[ni][nj], dp[i][j] + t[j][nj]);
		}
	}
	int ans = INF;
	rep(i, 1 << n)rep(j, n) {
		if (a[j] && __builtin_popcount(i) >= m)chmin(ans, dp[i][j]);
	}
	cout << ans << endl;
	return 0;
}