#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 4e5 + 5;
const int inf = 0x3f3f3f3f;

inline int read(void)
{
	int res=0;
	char c=getchar();
	while(c<'0'||c>'9') c=getchar();
	while(c>='0'&&c<='9') res=res*10+c-'0', c=getchar();
	return res;
}

char s[MAXN * 2];
int a[MAXN], dep[MAXN];

int main(void)
{
//	freopen("bracket.in","r",stdin);
//	freopen("bracket.out","w",stdout);
	
	int n = read(), X = read(), Y = read();
	scanf("%s",s+1);
	for(int i=1; i<=n; ++i) a[i] = read();
	
	if(X == 0 && Y == 0)
	{
		printf("0");
		return 0;
	}
	
	{
		int curdep = 0, curid = 0;
		for(int i=1; i<=2*n; ++i)
		{
			if(s[i] == '(')
				dep[++curid] = curdep++;
			else --curdep;
		}
	}
	
	if(X == 1 && Y == 0)
	{
		static int siz[MAXN];
		for(int i=1; i<=n; ++i) ++siz[dep[i]];
		for(int i=1; i<n-1; ++i) siz[i] += siz[i-1];
		for(int i=0; i<n-1; ++i) siz[i] -= i;
		
		int beg = 0;
		while(beg<n && siz[beg] == 1) ++beg;
		if(beg == n)
		{
			printf("0");
			return 0;
		}
		
		int mid = beg;
		while(siz[mid] == 2) ++mid;
		
		static int mn[MAXN], mx[MAXN];
		memset(mn, 0x3f, sizeof(mn));
		memset(mx, 0xc0, sizeof(mx));
		for(int i=1; i<=n; ++i)
		{
			mn[dep[i]] = min(mn[dep[i]], a[i]);
			mx[dep[i]] = max(mx[dep[i]], a[i]);
		}
		
		auto getres = [&] (int x,int y) -> ll
		{
			ll cur = 0;
			for(int i=mid; i<n-1; ++i)
			{
				x = min(x, mn[i]);
				y = max(y, mx[i]);
				cur += (ll)x * (siz[i] - 2);
			}
			return cur - y;
		};
		
		int x = inf, y = -inf;
		for(int i=beg; i<mid; ++i)
		{
			x = min(x, mn[i]);
			y = max(y, mx[i]);
		}
		
		ll ans;
		if(beg == mid) ans = getres(x, y);
		else ans = min(getres(x, x), getres(y, y));
		
		for(int i=1; i<=n; ++i) if(dep[i] >= beg)
			ans += a[i];
		printf("%lld",ans);
		return 0;
	}
	else
	{
		static int id[MAXN];
		iota(id+1, id+n+1, 1);
		sort(id+1, id+n+1, [&] (int x,int y){
			return dep[x] < dep[y];
		});
		
		ll ans = 0;
		priority_queue<int> t;
		ll sum = 0;
		int mn = -1;
		for(int rt=0, ut=1; rt<n; ++rt)
		{
			while(ut<=n && dep[id[ut]] <= rt)
			{
				int u = id[ut++];
				t.push(a[u]); sum += a[u];
				
				if((int)t.size() == 1) mn = a[u];
				else mn = min(mn, a[u]);
			}
			
			int mx = t.top();
			if(X == 0)// X == 0, Y == 1
			{
				ans += sum - mx;
				sum -= mx; t.pop();
			}
			else// X == 1, Y == 1
			{
				ans += sum - mn;
				ans += (ll)mn * ((int)t.size() - 1);
				sum -= mx; t.pop();
			}
		}
		printf("%lld",ans);
		return 0;
	}
	return 0;
}