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

INF = 1<<60

dp = [[INF]*N for _ in range(1<<N)]
for i in range(N):
    dp[1<<i][i] = 0
for bit in range(1<<N):
    for i in range(N):
        if dp[bit][i] == INF:
            continue
        for j in range(N):
            if not 1<<j & bit:
                dp[bit|1<<j][j] = min(dp[bit|1<<j][j], dp[bit][i]+T[i][j])

MIN = [INF]*N
for i in range(N):
    for j in range(K):
        MIN[i] = min(MIN[i], T[i][A[j]-1])

ans = INF
for bit in range(1<<N):
    if bit.bit_count() < M:
        continue
    for i in range(N):
        ans = min(ans, dp[bit][i]+MIN[i])

print(ans)