#include<iostream>
#include<cstdio>
#include<vector>
#define N 200000
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;
}
int n,q,a[N+1],b[N+1];
long long res;
char c[N+1],cs[N+1];
struct reads
{
	int num,data;
};
reads operator + (reads a,reads b)
{
	return a.data<=b.data?a:b;
}
struct seg
{
	struct node
	{
		int l,r,sminn,lazy;
		reads minn,minn2;
	};
	node tree[(N<<2)+1];
	void push_up(int k)
	{
		tree[k].sminn=min(tree[k<<1].sminn,tree[k<<1|1].sminn),tree[k].minn=tree[k<<1].minn+tree[k<<1|1].minn,tree[k].minn2=tree[k<<1].minn2+tree[k<<1|1].minn2;
		return;
	}
	void spread(int k)
	{
		if (tree[k].lazy)
		{
			tree[k<<1].sminn+=tree[k].lazy,tree[k<<1].lazy+=tree[k].lazy;
			tree[k<<1|1].sminn+=tree[k].lazy,tree[k<<1|1].lazy+=tree[k].lazy;
			tree[k].lazy=0;
		}
		return;	
	}
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r;
		if (l==r)
		{
			if (cs[l]=='(') tree[k].minn=(reads){l,0},tree[k].minn2=(reads){l,inf};
			else tree[k].minn=(reads){l,inf},tree[k].minn2=(reads){l,0};
			return;
		}
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
		return;
	}
	void add(int k,int l,int r,int d)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			tree[k].sminn+=d,tree[k].lazy+=d;
			return;
		}
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) add(k<<1,l,r,d);
		else if (l>=mid+1) add(k<<1|1,l,r,d);
		else add(k<<1,l,mid,d),add(k<<1|1,mid+1,r,d);
		push_up(k);
		return;
	}
	void change(int k,int x,int d,int d2)
	{
		if (tree[k].l==tree[k].r)
		{
			tree[k].minn.data=d,tree[k].minn2.data=d2;
			return;
		}
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (x<=mid) change(k<<1,x,d,d2);
		else change(k<<1|1,x,d,d2);
		push_up(k);
		return;
	}
	int find(int k,int x)
    {
		if (tree[k].l==tree[k].r) return tree[k].sminn>0?x:x-1;
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (x<=mid)
		{
			if (tree[k].l==x)
			{
				if (tree[k<<1].sminn>0) return find(k<<1|1,mid+1);
				else return find(k<<1,x);
			}
			else
			{
				int ps=find(k<<1,x);
				if (ps==mid) return find(k<<1|1,mid+1);
				else return ps;
			}
		}
		else return find(k<<1|1,x);
	}
	int find2(int k,int x)
	{
		if (tree[k].l==tree[k].r) return tree[k].sminn>0?x:x+1;
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (x<=mid) return find2(k<<1,x);
		else
		{
			if (tree[k].r==x)
			{
				if (tree[k<<1|1].sminn>0) return find2(k<<1,mid);
				else return find2(k<<1|1,x);
			}
			else
			{
				int ps=find2(k<<1|1,x);
				if (ps==mid+1) return find2(k<<1,mid);
				else return ps;
			}
		}
	}
	reads query(int k,int l,int r)
	{
		if (l>r) return (reads){0,inf};
		if (tree[k].l==l&&tree[k].r==r) return tree[k].minn;
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) return query(k<<1,l,r);
		else if (l>=mid+1) return query(k<<1|1,l,r);
		else return query(k<<1,l,mid)+query(k<<1|1,mid+1,r);
	}
	reads query2(int k,int l,int r)
	{
		if (l>r) return (reads){0,inf};
		if (tree[k].l==l&&tree[k].r==r) return tree[k].minn2;
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) return query2(k<<1,l,r);
		else if (l>=mid+1) return query2(k<<1|1,l,r);
		else return query2(k<<1,l,mid)+query2(k<<1|1,mid+1,r);
	}
};
seg T;
void change(int x,int d)
{
	reads ds;
	int rt,ps,rst;
	if (c[x]!=cs[x]) res+=d-a[x];
	a[x]=d;
	if (c[x]==cs[x]) rst=a[x];
	else rst=-a[x];
	if (cs[x]=='(') ps=T.find(1,x),ds=T.query2(1,1,ps),rt=ds.num,rst+=ds.data;
	else ps=T.find2(1,x),ds=T.query(1,ps,n<<1),rt=ds.num,rst+=ds.data;
	if (rst<0)
	{
		res+=rst;
		if (cs[x]=='(') cs[x]=')',T.change(1,x,inf,(c[x]==')')?a[x]:-a[x]),cs[rt]='(',T.change(1,rt,(c[rt]=='(')?a[rt]:-a[rt],inf);
		else cs[x]='(',T.change(1,x,(c[x]=='(')?a[x]:-a[x],inf),cs[rt]=')',T.change(1,rt,inf,(c[rt]==')')?a[rt]:-a[rt]);
	}
	else
	{
		if (cs[x]=='(') T.change(1,x,(c[x]=='(')?a[x]:-a[x],inf);
		else T.change(1,x,inf,(c[x]==')')?a[x]:-a[x]);
	}
	return;
}
int main()
{
	int x,d;
	n=read(),q=read(),T.build(1,1,n<<1);
	for (int i=1;i<=(n<<1);++i) b[i]=read();
	for (int i=1;i<=(n<<1);++i) cin>>c[i],cs[i]=(i&1)?'(':')';
	for (int i=1;i<=(n<<1);++i) change(i,b[i]);
	printf("%lld\n",res);
	for (int i=1;i<=q;++i) x=read(),d=read(),change(x,d),printf("%lld\n",res);
	return 0;
}