import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
input = sys.stdin.readline
sys.set_int_max_str_digits(0)
n,m,k = map(int,input().split())
a = set(map(lambda x:int(x)-1,input().split()))

t = [list(map(int,input().split())) for i in range(n)]
dp = [[[1<<60 for i in range(m+1)] for fff in range(n)] for j in range(1<<n)]
for i in range(n):
    dp[1<<i][i][1] = 0
ans = 1<<60
for s in range(1<<n):
    for i in range(n):
        if (s >> i) & 1 == 0:continue
        if i in a and bin(s).count('1') >= m:
            ans = min(ans,dp[s][i][m])

        for j in range(n):
            if (s >> j) & 1 == 1:continue
            for l in range(m):
                dp[s | (1 << j)][j][l+1] = min(dp[s | (1 << j)][j][l+1], dp[s][i][l] + t[i][j])
        
print(ans)