import sys
input = sys.stdin.readline

from heapq import heappop,heappush

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

for i in range(K):
    A[i]-=1

ANS=1<<60

for a in A:
    DP=[[1<<60]*(1<<N) for i in range(N)]
    DP[a][1<<a]=0

    Q=[(0,a,1<<a)]

    while Q:
        time,now,b=heappop(Q)
        if DP[now][b]!=time:
            continue

        for i in range(N):
            if b & (1<<i) != 0:
                continue
            nb=b|(1<<i)

            if DP[i][nb]>time+T[now][i]:
                DP[i][nb]=time+T[now][i]
                heappush(Q,(DP[i][nb],i,nb))

    #print(DP)

    for i in range(N):
        for j in range(1<<N):
            if j.bit_count()>=M:
                ANS=min(ANS,DP[i][j])

print(ANS)