#include<bits/stdc++.h>
#define N 200010
#define pii pair<int,int>
#define fi first
#define se second
#define ll long long
#define lc k<<1
#define rc k<<1|1
#define inf 0x3f3f3f3f
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define Down(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
int n,m,a[N],v[N],sum,cnt,pos[N];
int x[N*3],y[N*3],cp[N*3],num[30];
int val[N<<2],adt[N<<2],in[N];
pii mx[N<<2],mn[N<<2];
ll ans[N*3];
char s[N];
bool mark[N];
inline pii min(pii a,pii b){return pii(min(a.fi,b.fi),a.fi<b.fi?a.se:b.se);}
inline pii max(pii a,pii b){return pii(max(a.fi,b.fi),a.fi>b.fi?a.se:b.se);}
inline void upd(int k,int d){val[k]+=d,adt[k]+=d;}
inline int read()
{
    register int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x;
}

inline void print(ll x)
{
    num[0]=0;
    while(x) num[++num[0]]=x%10,x/=10;
    while(num[0]) putchar(num[num[0]--]+'0');
    return void(putchar('\n'));
}

inline void pushdown(int k)
{
    if(!adt[k]) return;
    upd(lc,adt[k]),upd(rc,adt[k]);
    return void(adt[k]=0);
}

inline void build(int k,int l,int r)
{
    mx[k]=pii(-inf,0);
    mn[k]=pii(inf,0);
    adt[k]=val[k]=0;
    if(l == r) return;
    int mid=l+r>>1;
    return build(lc,l,mid),build(rc,mid+1,r);
}

inline void modify(int k,int l,int r,int x,int y,int d)
{
    if(l >= x && r <= y) return upd(k,d);
    int mid=l+r>>1;pushdown(k);
    if(x <= mid) modify(lc,l,mid,x,y,d);
    if(mid < y) modify(rc,mid+1,r,x,y,d);
    return void(val[k]=max(val[lc],val[rc]));
}

inline int findl(int k,int l,int r,int pos)
{
    if(val[k] < 0) return 0;
    if(l == r) return l;
    int mid=l+r>>1,res=0;pushdown(k);
    if(mid < pos) res=findl(rc,mid+1,r,pos);
    return res?res:findl(lc,l,mid,pos);
}

inline int findr(int k,int l,int r,int pos)
{
    if(val[k] < 0) return cnt;
    if(l == r) return l;
    int mid=l+r>>1,res=cnt;pushdown(k);
    if(pos <= mid) res=findr(lc,l,mid,pos);
    return res<cnt?res:findr(rc,mid+1,r,pos);
}

inline int query(int k,int l,int r,int x,int y)
{
    if(l >= x && r <= y) return val[k];
    int mid=l+r>>1,res=-inf;pushdown(k);
    if(x <= mid) res=max(res,query(lc,l,mid,x,y));
    if(mid < y) res=max(res,query(rc,mid+1,r,x,y));
    return res;
}

inline void change(int k,int l,int r,int pos,int t)
{
    if(l == r)
    {
        if(t) mn[k]=pii(inf,0),mx[k]=pii(v[l],l);
        else mn[k]=pii(v[l],l),mx[k]=pii(-inf,0);
        return;
    }int mid=l+r>>1;
    if(pos <= mid) change(lc,l,mid,pos,t);
    else change(rc,mid+1,r,pos,t);
    mn[k]=min(mn[lc],mn[rc]);
    mx[k]=max(mx[lc],mx[rc]);
    return;
}

inline pii qmx(int k,int l,int r,int x,int y)
{
    if(l >= x && r <= y) return mx[k];
    int mid=l+r>>1;pii res(-inf,0);
    if(x <= mid) res=max(res,qmx(lc,l,mid,x,y));
    if(mid < y) res=max(res,qmx(rc,mid+1,r,x,y));
    return res;
}

inline pii qmn(int k,int l,int r,int x,int y)
{
    if(l >= x && r <= y) return mn[k];
    int mid=l+r>>1;pii res(inf,0);
    if(x <= mid) res=min(res,qmn(lc,l,mid,x,y));
    if(mid < y) res=min(res,qmn(rc,mid+1,r,x,y));
    return res;
}

inline void ins(int x,ll &ans)
{
    int nmx=query(1,1,cnt,x,cnt);
    if(nmx > 0)
    {
        change(1,1,cnt,x,1),ans+=v[x];
        modify(1,1,cnt,x,cnt,-1),in[x]=1;
    }
    else
    {
        int np=x>1?findl(1,1,cnt,x-1):0;
        pii nw=qmx(1,1,cnt,np+1,cnt);
        if(nw.fi <= v[x]) return change(1,1,cnt,x,0);
        ans+=v[x]-nw.fi;
        in[x]=1,in[nw.se]=0;
        change(1,1,cnt,x,1);
        change(1,1,cnt,nw.se,0);
        modify(1,1,cnt,x,cnt,-1);
        modify(1,1,cnt,nw.se,cnt,1);
    }
    return;
}

inline void del(int x,ll &ans)
{
    if(!in[x]) return;
    int np=findr(1,1,cnt,x);
    pii nw=qmn(1,1,cnt,1,np);
    ans-=v[x],change(1,1,cnt,x,0);
    modify(1,1,cnt,x,cnt,1),in[x]=0;
    if(nw.fi == inf) return;
    ans+=nw.fi,change(1,1,cnt,nw.se,1);
    modify(1,1,cnt,nw.se,cnt,-1),in[nw.se]=1;
    return;
}

inline void solve()
{
    while(cnt && !mark[cnt]) cnt--;
    if(!cnt) return;
    build(1,1,cnt);
    For(i,1,cnt) if(mark[i])
        modify(1,1,cnt,i,cnt,1);
    For(i,1,cnt) ins(i,ans[0]);
    For(i,1,m)
    {
        ans[i]=ans[i-1];
        if(cp[i] && cp[i] <= cnt)
        {
            del(cp[i],ans[i]);
            v[cp[i]]=y[i];
            ins(cp[i],ans[i]);
        }
    }
    return;
}

int main()
{
    n=read()<<1,m=read();
    For(i,1,n) a[i]=read();
    scanf("%s",s+1);
    For(i,1,m) x[i]=read(),y[i]=read();
    For(i,1,n)
    {
        if(s[i] == ')') v[++cnt]=a[i],pos[i]=cnt;
        sum+=s[i]=='('?1:-1;
        if(sum < 0) mark[cnt]=true,sum=1;
    }For(i,1,m) cp[i]=pos[x[i]];
    solve(),sum=cnt=0;
    memset(mark,false,sizeof(mark));
    memset(pos,0,sizeof(pos));
    memset(in,0,sizeof(in));
    Down(i,n,1)
    {
        if(s[i] == '(') v[++cnt]=a[i],pos[i]=cnt;
        sum+=s[i]==')'?1:-1;
        if(sum < 0) mark[cnt]=true,sum=1;
    }For(i,1,m) cp[i]=pos[x[i]];
    solve();
    For(i,0,m) printf("%lld\n",ans[i]);
    return 0;
}