N,M,K = map(int,input().split())
A = list(map(int,input().split()))
A = [A[i]-1 for i in range(K)]
A1 = [0]*N
for i in range(K):
    A1[A[i]] = 1
T = [list(map(int,input().split())) for _ in range(N)]
INFTY = 10**10
dp = [[INFTY for _ in range(N)] for _ in range(1<<N)]
for s in range(1<<N):
    for i in range(N):
        n = bin(s).count("1")
        if n>=M and (s>>i & 1) and A1[i]==1:
            dp[s][i] = 0
for s in range((1<<N)-1,1,-1):
    for i in range(N):
        for j in range(N):
            if j==i or (s>>j & 1)==0 or (s>>i & 1)==0:continue
            dp[s][j] = min(dp[s][j],dp[s][i]+T[j][i])
            dp[s-(1<<i)][j] = min(dp[s-(1<<i)][j],dp[s][i]+T[j][i])
ans = INFTY
for i in range(N):
    ans = min(ans,dp[1<<i][i])
print(ans)