#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(k);
  rep(i,0,k) {
    cin >> a[i];
    --a[i];
  }
  vector<vector<int>> t(n, vector<int>(n));
  rep(i,0,n) rep(j,0,n) cin >> t[i][j];
  int ans = 1000000000;
  function<void(int,int,int)> rec = [&](int v, int b, int val) {
    int c = __builtin_popcount(b);
    if (c == m) {
      rep(i,0,k) {
        ans = min(ans, val + t[v][a[i]]);
      }
      return;
    }
    rep(i,0,n) {
      if (!((b >> i)&1)) {
        rec(i, b | (1 << i), val + t[v][i]);
      }
    }
  };
  rep(i,0,n) {
    rec(i, 1<<i, 0);
  }
  cout << ans << endl;
  return 0;
}