#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pr;

const int MAXN=4e5,INF=1e7;

inline int Read()
{
	int res;char c;
	while(1) {c=getchar();if('0'<=c && c<='9') {res=c-'0';break;}}
	while(1) {c=getchar();if('0'<=c && c<='9') res=res*10+c-'0';else break;}
	return res;
}

int n,X,Y;ll ans;
bool s[2*MAXN+5];int Code[2*MAXN+5],Tail;
int stk[MAXN+5],tp,Match[2*MAXN+5];
inline void ScanS()
{
	while(getchar()!='(');
	s[1]=1;
	for(int i=2;i<=2*n;i++) s[i]=(getchar()=='(');
}
int A[MAXN+5],B[MAXN+5];
ll pre[MAXN+5],suf[MAXN+5];//到每层的值的个数
vector<int> nxt[MAXN+5];
set<pr> Q;
int minn[MAXN+5];

void Build(int now,int L,int R)
{
	for(int i=L,j;i<=R;i=j+1)
	{
		j=Match[i];
		nxt[now].push_back(Code[i]);
		if(j-i>1) Build(Code[i],i+1,j-1);
	}
}
int depth[MAXN+5];
vector<int> buc[MAXN+5];
void CalMsg(int now)
{
	buc[depth[now]].push_back(now);
	for(int i=0;i<nxt[now].size();i++) depth[nxt[now][i]]=depth[now]+1,CalMsg(nxt[now][i]);
}

int main()
{
	//freopen("bracket3.in","r",stdin);
	//freopen("mine.txt","w",stdout);
	n=Read(),X=Read(),Y=Read();
	ScanS();
	for(int i=1;i<=n;i++) A[i]=Read();
	if(!X && !Y) return printf("0\n"),0;
	for(int i=1;i<=2*n;i++)
		if(s[i]) Code[i]=++Tail,stk[++tp]=i;
		else Match[stk[tp--]]=i;
	Build(0,1,2*n),CalMsg(0);
	if(!X)
	{
		ll sum=0;
		for(int i=1;i<n;i++)
		{
			for(int j=0;j<buc[i].size();j++) Q.insert(make_pair(A[buc[i][j]],buc[i][j])),sum+=A[buc[i][j]];
			sum-=(*--Q.end()).first,ans+=sum,Q.erase(--Q.end());
		}
		printf("%lld\n",ans);
		return 0;
	}
	if(!Y)
	{
		ll sum=0; for(int i=1;i<=n;i++) sum+=A[i];
		B[0]=1; for(int i=1;i<=n;i++) B[i]=B[i-1]-1+buc[i].size();
		//for(int i=1;i<=n;i++) printf("%d ",B[i]);printf("\n");
		//最小值*(每层个数-2)
		int Head=1;
		for(;Head<=n && B[Head]==1;Head++) sum-=A[buc[Head][0]];//前去前缀 1 
		if(Head>n) return printf("0\n"),0;//全是 1
		Tail=Head-1; while(B[Tail+1]==2) ++Tail;//[Head,Tail] 是 2 段
		if(Tail==n-1)//没有 >=3 
		{
			int maxn=0;
			for(int i=Head;i<=n;i++)
				for(int j=0;j<buc[i].size();j++)
					maxn=max(maxn,A[buc[i][j]]);
			return printf("%lld\n",sum-maxn),0;
		}
		//[Head,Tail] 中插入的数字选个出来作为给 >=3 段的数
		minn[Tail]=INF;
		int maxn=0;
		for(int i=Tail+1;i<=n-2;i++)
		{
			minn[i]=minn[i-1];
			for(int j=0;j<buc[i].size();j++) minn[i]=min(minn[i],A[buc[i][j]]),maxn=max(maxn,A[buc[i][j]]);
			pre[i]=pre[i-1]+B[i]-2;
		}
		for(int i=n-2;i>Tail;i--) suf[i]=suf[i+1]+1ll*(B[i]-2)*minn[i];
		if(Head>Tail)//没有 2 
			return printf("%lld\n",sum+suf[Head]-maxn),0;
		ans=1e18;
		for(int i=Head;i<=Tail;i++)
			for(int j=0;j<buc[i].size();j++)
			{
				int L=Tail+1,R=n-2,v=A[buc[i][j]];
				for(int mid;L<=R;)
				{
					mid=(L+R)>>1;
					if(v<=minn[mid]) L=mid+1;
					else R=mid-1;
				}
				ans=min(ans,1ll*pre[R]*v+suf[R+1]-max(maxn,v));
			}
		printf("%lld\n",sum+ans);
		return 0;
	}
	ll sum=0;int cnt=0;
	for(int i=1;i<n;i++)
	{
		for(int j=0;j<buc[i].size();j++) Q.insert(make_pair(A[buc[i][j]],buc[i][j])),sum+=A[buc[i][j]],++cnt;
		ans+=1ll*(*Q.begin()).first*(cnt-2)+sum;
		sum-=(*--Q.end()).first,--cnt,Q.erase(--Q.end());
	}
	printf("%lld\n",ans);
	return 0;
}