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

# dfs で順列全探索
def generate_permutations(n, m):
	permutations = []
	used = [False] * n

	def dfs(determined, used):
		if len(determined) == m:
			permutations.append(determined[:])
		else:
			for x in range(n):
				if used[x]:
					continue
				used[x] = True
				determined.append(x)
				dfs(determined, used)
				determined.pop()
				used[x] = False	
  
	dfs([], used)
  
	return permutations


for p in generate_permutations(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)