#include<bits/stdc++.h>
#define ll int
#define N 500005
using namespace std;
ll n,m,q,s,t,i,j,x,y,z,c,ans,temp,rev[N],ttt,ans1,ans2,wss[N],k[N],inf,id1[N],in[N],ot[N],las[N];
ll head,tail,que[N<<2];
ll la[N],ne[N],to[N],val[N],w[N],dis[N],tot=1,vis[N],viss[N];
inline void merge(ll x,ll y,ll z,ll c){
	tot++,ne[tot] = la[x],la[x] = tot,to[tot] = y,val[tot] = z,w[tot] = c;
	tot++,ne[tot] = la[y],la[y] = tot,to[tot] = x,val[tot] = 0,w[tot] = -c;
}
bool spfa(){
	for(ll i=0;i<inf;i++) dis[i]=0x3f3f3f3f;
	dis[s]=0;
	head=1,que[tail=1]=s;
	while(head<=tail){
		ll tmp = que[head++];
		vis[tmp] = 0;
		for(ll i=la[tmp];i;i=ne[i]){
			if(val[i]>0&&dis[to[i]]>dis[tmp]+w[i]){
				dis[to[i]] = dis[tmp]+w[i];
				if(!vis[to[i]]) vis[to[i]]=1,que[++tail]=to[i];
			}
		}
	}
	return dis[t]<=1e9;
}
ll dfs(ll x,ll step){
	if(x==t) return step;
	viss[x] = 1;
	ll used = 0;
	for(ll i=la[x];i;i=ne[i]){
		if(dis[x]+w[i]==dis[to[i]]&&val[i]>0&&!viss[to[i]]){
			ll temp = dfs(to[i],min(val[i],step-used));
			val[i] -= temp,val[i^1] += temp,used += temp;
			if(used==step) return used;
		}
	}
	return used;
}
int main(){
	ios::sync_with_stdio(false);
	s=0,inf=1;
	cin>>n>>m>>q;
	for(i=1;i<=n;i++) cin>>wss[i];
	for(i=1;i<=q;i++) cin>>k[i],ans2+=wss[k[i]];
	for(i=2;i<=q;i++) in[i]=inf++;
	t=in[q];
	for(i=1;i<q;i++) merge(in[i],in[i+1],m-1,0);
	for(i=1;i<=q;i++){
		if(las[k[i]]){
			if(las[k[i]]==i-1) ans2-=wss[k[i]];
			else merge(in[las[k[i]]+1],in[i],1,-wss[k[i]]);
		}
		las[k[i]]=i;
	}
	while(spfa()){
		for(i=0;i<inf;i++) viss[i]=0;
		ll temp = dfs(s,1e9);
		ans1 += temp,ans2 += temp*dis[t];
	}
	cout<<ans2<<endl;
	return 0;
}