// #ifndef ONLINE_JUDGE
// #define _GLIBCXX_DEBUG 1 //[]で配列外参照をするとエラーにしてくれる。上下のやつがないとTLEになるので注意 ABC311Eのサンプル4みたいなデバック中のTLEは防げないので注意
// #endif

#ifdef ONLINE_JUDGE
#define NDEBUG
#include <atcoder/all>
#endif
#include <bits/stdc++.h>
using namespace atcoder;

using namespace std;
using ll = long long;
using ld = long double;
ll INF = 2e18;
using P = pair<ll, ll>;
#define pb push_back
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reprev(i, n) for (ll i = (n) - 1; i >= 0; i--)
#define reps(i, n) for (ll i = 1; i <= (n); i++)
#define for_(i, a, b) for (ll i = (a); i < (b); i++)
#define all(v) v.begin(), v.end()
template <typename T>
inline bool chmin(T &a, const T &b)
{
  bool c = a > b;
  if (c)
    a = b;
  return c;
}
template <typename T>
inline bool chmax(T &a, const T &b)
{
  bool c = a < b;
  if (c)
    a = b;
  return c;
}
template <typename T>
inline T ceil(T a, T b) { return (a + (b - 1)) / b; }
using mint = modint998244353;
// using mint = modint1000000007;
// using mint = static_modint<10>;//使うときはコメントアウトを外す
template <typename T>
using vc = vector<T>;
template <class T>
istream &operator>>(istream &i, vc<T> &v)
{
  rep(j, (ll)size(v)) i >> v[j];
  return i;
}
template <class T>
ostream &operator<<(ostream &o, const vc<T> &v)
{
  rep(j, (ll)size(v))
  {
    if (j)
      o << " ";
    o << v[j];
  }
  o << endl;
  return o;
}
ll N, M, K;
vc<ll> A;
vc<vc<ll>> T;
ll dfs(ll prev, ll size, vc<ll> &used)
{
  if (size == M)
  {
    ll min = INF;
    rep(i, K)
    {
      chmin(min, T[prev][A[i]]);
    }
    return min;
  }
  ll ans = INF;
  rep(i, N)
  {
    if (used[i] == 0)
    {
      used[i] = 1;
      chmin(ans, dfs(i, size + 1, used) + T[prev][i]);
      used[i] = 0;
    }
  }
  return ans;
}
void solve()
{
  ll ans = INF;
  rep(i, N)
  {
    vc<ll> used(N, 0);
    used[i] = 1;
    ans = min(ans, dfs(i, 1, used));
  }
  cout << ans << endl;
}
int main()
{
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  // ref:https://rsk0315.hatenablog.com/entry/2020/05/09/170315
  cin >> N >> M >> K;
  A.resize(K);
  T.resize(N, vc<ll>(N));
  cin >> A;
  rep(i, K)
  {
    A[i]--;
  }
  cin >> T;
  solve();
  return 0;
}