N,M,K = list(map(int,input().split()))
A = list(map(lambda x:int(x)-1,input().split()))
T = [list(map(int,input().split())) for _ in range(N)]

INF = 10**18
dp = [[INF for _ in range(N)] for _ in range(1<<N)]
for i in range(N):
    dp[1<<i][i] = 0

for i in range(1<<N):
    for j in range(N):
        if(dp[i][j] == INF):continue
        for k in range(N):
            next = i|(1<<k)
            if(next == i):continue
            dp[next][k] = min(dp[next][k], dp[i][j] + T[j][k])

ans = INF
for i in range(1<<N):
    if(i.bit_count() >= M):
        for j in A:
            ans = min(ans,dp[i][j])
print(ans)