from itertools import permutations

n, m, k = map(int, input().split())
a = set(map(lambda x: int(x) - 1, input().split()))
t = [list(map(int, input().split())) for _ in range(n)]

ans = 10**18

for p in permutations(range(n), m):
    if p[-1] not in a:
        continue
    ans = min(ans, sum(t[p[i]][p[i+1]] for i in range(m-1)))

print(ans)