#include<bits/stdc++.h>
#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 ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
template < int N, int Ne >  struct flow { 
	using F = ll; // flow type
	F inf = 1e18;
	int n, s, t; // Remember to assign n, s and t !
	int ehd[N], pre[N], cur[N], ev[Ne << 1], enx[Ne << 1], eid = 1;
	void clear() {
		eid = 1, memset(ehd, 0, sizeof(ehd));
	}
	F ew[Ne << 1], ec[Ne << 1], dis[N];
	void Eadd(int u, int v, F w, F c) {
		++eid, enx[eid] = ehd[u], ew[eid] = w, ec[eid] = c, ev[eid] = v, ehd[u] = eid;
	}
	void add(int u, int v, F w, F c) {
		Eadd(u, v, w, c), Eadd(v, u, 0, -c);
	}
	bool spfa() {
		queue < int > q;
		L(i, 1, n) dis[i] = inf, cur[i] = ehd[i]; 
		q.push(s), dis[s] = 0;
		while(!q.empty()) {
			int u = q.front();
			q.pop();
			for(int i = ehd[u]; i; i = enx[i]) if(ew[i] && dis[ev[i]] > dis[u] + ec[i]) {
				dis[ev[i]] = dis[u] + ec[i], pre[ev[i]] = i, q.push(ev[i]);
			}
		}
//		L(i, 1, n + 3) cout << dis[i] << " "; 
//		cout << "\n";
		return dis[t] < inf;
	}
	pair < F, F > max_flow() {
		F res1 = 0, res2 = 0;
		while(spfa()) {
			F o = inf;
			for(int x = t; x != s; x = ev[pre[x] ^ 1]) o = min(o, ew[pre[x]]);
			for(int x = t; x != s; x = ev[pre[x] ^ 1]) ew[pre[x]] -= o, ew[pre[x] ^ 1] += o;
			res1 += o, res2 += o * dis[t];
//			cout << dis[t] << " : " << o << "\n";
		}
		return make_pair(res1, res2);
	}
} ; 

const int N = 2e5 + 7;

flow < N, N * 2 > G;

int n, m, q;
int idl[N], idr[N];
int w[N], K[N], lst[N];
int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m >> q;
	G.s = ++G.n, G.t = ++G.n;
	L(i, 1, n) {
		cin >> w[i];
	}
	L(i, 0, q + 1) {
		idl[i] = ++G.n;
		idr[i] = ++G.n;
	}
	L(i, 1, q) {
		G.add(G.s, idl[i], 1, 0);
		G.add(idr[i], G.t, 1, 0);
	}
	G.add(G.s, idl[0], m, 0);
	G.add(idr[q + 1], G.t, m, 0);
	L(i, 1, q) {
		cin >> K[i];
		if(lst[K[i]]) {
			G.add(idl[lst[K[i]]], idr[i], 1, 0);
		}
		lst[K[i]] = i;
	}
	
	int pre = idl[0];
	L(i, 1, q) {
		G.add(pre, idr[i], 1, w[K[i]]);
		++G.n;
		G.add(pre, G.n, m, 0);
		G.add(idl[i], G.n, m, 0);
		pre = G.n;
	}
	G.add(pre, idr[q + 1], m, 0);
	auto mp = G.max_flow();
	cout << mp.second << '\n';
	return 0;
}