(n,m,k),a,*t=[[*map(int,s.split())]for s in open(0)]
a={i-1 for i in a}
INF=1<<60
dp=[[INF]*(1<<n)for _ in range(n)]
for i in range(n):
  dp[i][1<<i]=0
for s in range(1<<n):
  for i in range(n):
    if not s>>i&1:
      continue
    for j in range(n):
      if s>>j&1:
        continue
      ns=s|1<<j
      dp[j][ns]=min(dp[j][ns],dp[i][s]+t[i][j])
ans=INF
for s in range(1<<n):
  t=bin(s).count('1')
  if t<m:
    continue
  for i in range(n):
    if i in a:
      ans=min(ans,dp[i][s])
print(ans)