#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

template<int N, int M>
struct MCMF {
  const LL inf = 1e18;
  int n, hd[N], cur[N], tot = 1, S, T;
  LL h[N], d[N];

  struct edge {
    int v, nx, w, c;
  } e[M * 2];

  void add_edge (int u, int v, int w, int c) {
    e[++tot] = {v, hd[u], w, c};
    hd[u] = tot;
    e[++tot] = {u, hd[v], 0, -c};
    hd[v] = tot;
  }

  bool vis[N];

  bool spfa () {
    L (i, 1, n) {
      h[i] = inf;
    }
    h[S] = 0;
    queue<int> q;
    q.push(S);
    vis[S] = true;
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      vis[u] = false;
      for (int i = hd[u], v; i; i = e[i].nx) {
        if (e[i].w) {
          v = e[i].v;
          LL x = h[u] + e[i].c;
          if (h[v] > x) {
            h[v] = x;
            if (!vis[v]) {
              q.push(v);
              vis[v] = true;
            }
          }
        }
      }
    }
    return h[T] < inf;
  }

  bool dij () {
    L (i, 1, n) {
      cur[i] = hd[i];
      d[i] = inf;
    }
    d[S] = 0;
    priority_queue<pair<LL, int>> q;
    q.emplace(0, S);
    while (!q.empty()) {
      int u = q.top().second;
      q.pop();
      if (vis[u]) {
        continue;
      }
      vis[u] = true;
      for (int i = hd[u], v; i; i = e[i].nx) {
        if (e[i].w) {
          v = e[i].v;
          LL x = d[u] + e[i].c + h[u] - h[v];
          if (d[v] > x) {
            d[v] = x;
            q.emplace(-x, v);
          }
        }
      }
    }
    L (i, 1, n) {
      vis[i] = false;
      h[i] += d[i];
    }
    return d[T] < inf;
  }

  LL cost;

  LL dfs (int u, LL in) {
    if (u == T) {
      return in;
    }
    vis[u] = true;
    LL out = 0;
    for (int &i = cur[u], v; i; i = e[i].nx) {
      if (e[i].w && !vis[v = e[i].v]) {
        LL c = e[i].c;
        if (h[v] == h[u] + c) {
          LL w = dfs(v, min(in, (LL)e[i].w));
          in -= w;
          out += w;
          e[i].w -= w;
          e[i ^ 1].w += w;
          cost += w * c;
          if (!in) {
            break;
          }
        }
      }
    }
    vis[u] = false;
    return out;
  }

  pair<LL, LL> dinic () {
    LL flow = 0;
    cost = 0;
    if (spfa()) {
      while (dij()) {
        flow += dfs(S, inf);
      }
    }
    return make_pair(flow, cost);
  }
};

constexpr int N = 5e3 + 9;
constexpr int inf = 1e9;
int n, m, q, w[N], k[N], id[N][3];

MCMF<3 * N, 5 * N> G;

int lst[N];

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m >> q;
  L (i, 1, n) {
    cin >> w[i];
  }
  L (i, 1, q) {
    cin >> k[i];
  }
  id[0][0] = ++G.n;
  L (i, 1, q) {
    L (j, 0, 2) {
      id[i][j] = ++G.n;
    }
  }
  L (i, 1, q) {
    G.add_edge(id[i - 1][0], id[i][0], m - (i == 1), 0);
    G.add_edge(id[i - 1][0], id[i][1], 1, w[k[i]]);
    G.add_edge(id[i][1], id[i][2], 1, -inf);
    G.add_edge(id[i][2], id[i][0], 1, 0);
    if (lst[k[i]]) {
      G.add_edge(id[lst[k[i]]][2], id[i][1], 1, 0);
    }
    lst[k[i]] = i;
  }
  G.S = 1;
  G.T = id[q][0];
  cout << G.dinic().second + (LL)inf * q << '\n';
}
// I love WHQ!