#include<bits/stdc++.h>
using namespace std;
const int inf=1e9;
int h[10005],w[260000],to[260000],nxt[260000],dis[10005],dis1[10005],f[10005],lst[10005],k,s,t,n,m,cnt;
int rot[10005],p[260000],c[260000],x,y,ans,mx;
bool bl[10005];
void jb(int u,int v,int W,int C){
	++cnt;w[cnt]=W;c[cnt]=C;
	to[cnt]=v;nxt[cnt]=h[u];h[u]=cnt;
}
void JB(int u,int v,int W,int C){
	jb(u,v,W,C);jb(v,u,0,-C);
}
queue<int>q;
bool spfa(){
	for(int i=1;i<=k;i++) bl[i]=lst[i]=f[i]=0,dis[i]=inf;
	dis[s]=0,f[s]=inf;q.push(s);
	while(!q.empty()){
		int u=q.front();q.pop();
		bl[u]=0;
		for(int i=h[u];i!=0;i=nxt[i]){
			int v=to[i];
			if(w[i]>0&&dis[v]>dis[u]+c[i]){
				lst[v]=i;
				f[v]=min(f[u],w[i]);
				dis[v]=dis[u]+c[i];
				if(bl[v]==0){
					bl[v]=1;
					q.push(v);
				}
			}
		}
	}
	return lst[t]!=0;
}
#define pii pair<int,int>
#define fi first
#define se second
priority_queue<pii>pq;
int mk[10050];
bool dj(){
	for(int i=1;i<=k;i++)bl[i]=lst[i]=f[i]=mk[i]=0,dis[i]=inf;
	dis[s]=0,f[s]=inf,pq.push(make_pair(-dis[s],s));
	while(pq.size()){
		pii dog=pq.top();pq.pop();int u=dog.se;
		if(mk[u])continue;mk[u]=1;
		for(int i=h[u];i!=0;i=nxt[i]){
			int v=to[i];
			assert(c[i]+dis1[u]-dis1[v]>=0);
			if(w[i]>0&&dis[v]>dis[u]+c[i]+dis1[u]-dis1[v]){
				lst[v]=i;
				f[v]=min(f[u],w[i]);
				dis[v]=dis[u]+c[i]+dis1[u]-dis1[v];
				pq.push(make_pair(-dis[v],v));
			}
		}
	}dis[t]+=dis1[t];
	return lst[t]!=0;
}
int work(){
	bool fl=spfa();
	for(int i=1;i<=k;++i)dis1[i]=dis[i];
	int mncst=0;
	while(dj()==1){
		mncst+=dis[t]*f[t];
		for(int i=t;i!=s;i=to[lst[i]^1]){
			w[lst[i]]-=f[t];
			w[lst[i]^1]+=f[t];	
		}
	}
	return mncst;
}
int N,M,Q;
int Wc[5500],Id[5050],Lst[5050],stk[5050],tail;
int main(){
	cnt=1;
	cin>>N>>M>>Q;
	for(int i=1;i<=N;++i)scanf("%d",&Wc[i]);int ans1=0;
	for(int i=1;i<=Q;++i){
		scanf("%d",&Id[i]),ans1+=Wc[Id[i]];
		if(tail&&stk[tail]==Id[i])ans1-=Wc[Id[i]];
		else stk[++tail]=Id[i];
	}
	Q=tail;for(int i=1;i<=Q;++i)Id[i]=stk[i];
	k=t=Q+2,s=Q+1,t=Q+2;int lst1=s;
	for(int i=1;i<=Q;++i)JB(lst1,i,M-1,0),lst1=i;
	JB(lst1,t,M-1,0);
	for(int i=1;i<=Q;++i){
		if(Lst[Id[i]])JB(Lst[Id[i]]+1,i,1,-Wc[Id[i]]);
		Lst[Id[i]]=i;
	}
	int ans=work();
	printf("%d",ans+ans1);
	return 0;
}