#include<iostream>
#include<cstdio>
#include<queue>
#define N 5000
#define M 500000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct node
{
	int v,data,cost,nxt;
};
node edge[M+1];
struct reads
{
	int num;
	long long data;
	bool operator < (const reads &t)const
	{
		return data>t.data;	
	}
};
int n,m,q,s,t,head[N+1],cur[N+1],dis[N+1],w[N+1],ps[N+1],len=1;
long long d[N+1],ans;
bool vis[N+1];
void add(int x,int y,int z,int w)
{
	edge[++len]=(node){y,z,w,head[x]},head[x]=len;
	edge[++len]=(node){x,0,-w,head[y]},head[y]=len;
	return;
}
bool dijkstra()
{
	int top;
	priority_queue<reads>q;
	for (int i=s;i<=t;++i) dis[i]=-inf;
	dis[s]=0,q.push((reads){s,0});
	while (!q.empty())
	{
		top=q.top().num,q.pop();
		for (int i=head[top];i>0;i=edge[i].nxt)
			if (edge[i].data&&dis[edge[i].v]<dis[top]+edge[i].cost+d[top]-d[edge[i].v])
				dis[edge[i].v]=dis[top]+edge[i].cost+d[top]-d[edge[i].v],q.push((reads){edge[i].v,dis[edge[i].v]});
	}
	for (int i=s;i<=t;++i) d[i]+=dis[i];
	return dis[t]!=-inf;
}
int dinic(int x,int flow)
{
	if (x==t) return flow;
	int k;
	vis[x]=1;
	for (int &i=cur[x];i>0;i=edge[i].nxt)
		if (edge[i].data&&!vis[edge[i].v]&&d[edge[i].v]==d[x]+edge[i].cost)
		{
			k=dinic(edge[i].v,min(flow,edge[i].data));
			if (k)
			{
				edge[i].data-=k,edge[i^1].data+=k,vis[x]=0;
				return k;
			}
		}
	vis[x]=0;
	return 0;
}
int main()
{
	int x,flow;
	n=read(),m=read(),q=read(),s=0,t=q;
	for (int i=1;i<=n;++i) w[i]=read();
	add(0,1,m-1,0);
	for (int i=1;i<=q-1;++i) add(i,i+1,inf,0);
	for (int i=1;i<=q;++i)
	{
		x=read();
		if (!ps[x]) ans+=w[x];
		else if (ps[x]+1<=i-1) add(ps[x]+1,i,1,w[x]),ans+=w[x];
		ps[x]=i;
	}
	for (int i=1;i<=q;++i) d[i]=-inf;
	for (int i=0;i<=q;++i)
		for (int j=head[i];j>0;j=edge[j].nxt)
			if (edge[j].data)
				d[edge[j].v]=max(d[edge[j].v],d[i]+edge[j].cost);
	while (dijkstra())
	{
		for (int i=s;i<=t;++i) cur[i]=head[i];
		while (flow=dinic(s,inf)) ans-=flow*d[t];
	}
	printf("%lld\n",ans);
	return 0;
}