import sys, time, random, heapq, math, itertools from collections import deque, Counter, defaultdict #from sortedcontainers import SortedSet, SortedList from bisect import bisect, bisect_left, bisect_right import heapq as hq from functools import cache, cmp_to_key def debug(*x):print('debug:',*x, file=sys.stderr) sys.setrecursionlimit(300000) input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 61 - 1 mod = 998244353 N,M,K = mi() A = set(a - 1 for a in li()) T = [li() for _ in range(N)] ans = inf for bit in range(1<> i) & 1] for p in itertools.permutations(l): cnt = 0 for i in range(len(p) - 1): cnt += T[p[i]][p[i+1]] last = p[-1] if last in A: ans = min(ans, cnt) else: for a in A: ans = min(ans, cnt + T[last][a]) print(ans)