#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, m, c;
  cin >> n >> m >> c;
  int flag = 0;
  for (int i = 0; i < c; ++i)
  {
    int a;
    cin >> a;
    --a;
    flag |= (1 << a);
  }
  vector<vector<int>> d(n, vector<int> (n));
  for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) cin >> d[i][j];
  vector<vector<int>> dp(1 << n, vector<int> (n, 1e9));
  for (int i = 0; i < n; ++i) dp[1 << i][i] = 0;
  for (int i = 0; i < 1 << n; ++i)
  {
    for (int j = 0; j < n; ++j)
    {
      if ((i & (1 << j)) == 0) continue;
      for (int k = 0; k < n; ++k)
      {
        int id = i | (1 << k);
        dp[id][k] = min(dp[id][k], dp[i][j] + d[j][k]);
      }
    }
  }
  int ans = 1e9;
  for (int i = 0; i < 1 << n; ++i)
  {
    if (__builtin_popcount(i) < m) continue;
    for (int j = 0; j < n; ++j)
    {
      if (flag & (1 << j))
      {
        ans = min(ans, dp[i][j]);
      }
    }
  }
  cout << ans << endl;
}