#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const int INF = 0x3f3f3f3f;
const int N = 2e5+25;
int n,Q;
int a[N],b[N];
bool c[N],s[N]; // (1,)0
struct Brack {
   int num,data;
   friend inline bool operator<(Brack p,Brack q) {
      return p.data<q.data;
   }
};
namespace SGT {
struct Node {
   int smn,tag;
   Brack mn1,mn2;
} tr[N<<2];
#define ls (u<<1)
#define rs (ls|1)
#define mid ((L+R)>>1)
void pushup(int u) {
   tr[u].smn=min(tr[ls].smn,tr[rs].smn);
   tr[u].mn1=min(tr[ls].mn1,tr[rs].mn1);
   tr[u].mn2=min(tr[ls].mn2,tr[rs].mn2);
}
void clac(int u,int k) { tr[u].smn+=k,tr[u].tag+=k; }
void pushdown(int u) {
   if(tr[u].tag) {
      clac(ls,tr[u].tag);
      clac(rs,tr[u].tag);
      tr[u].tag=0;
   }
}
void build(int u,int L,int R) {
   if(L==R) {
      tr[u]=(L&1?Node{1,0,{L,0},{L,INF}}:Node{0,0,{L,INF},{L,0}});
      return ;
   }
   build(ls,L,mid),build(rs,mid+1,R);
   pushup(u);
}
void update1(int u,int L,int R,int l,int r,int k) {
   if(l<=L&&R<=r) return clac(u,k);
   pushdown(u);
   if(l<=mid) update1(ls,L,mid,l,r,k);
   if(r> mid) update1(rs,mid+1,R,l,r,k);
   pushup(u);
}
void update2(int u,int L,int R,int x,int a,int b) {
   if(L==R) {
      tr[u].mn1.data=a;
      tr[u].mn2.data=b;
      return ;
   }
   pushdown(u);
   if(x<=mid) update2(ls,L,mid,x,a,b);
   else update2(rs,mid+1,R,x,a,b);
   pushup(u);
}
int find1(int u,int L,int R,int x) {
   if(L==R) return tr[u].smn>1?-1:x;
   pushdown(u);
   if(x<=mid) {
      if(L==x) {
         if(tr[ls].smn>1) return find1(rs,mid+1,R,mid+1);
         else return find1(ls,L,mid,x);
      } else {
         int p=find1(ls,L,mid,x);
         if(!~p) return find1(rs,mid+1,R,mid+1);
         else return p;
      }
   } else return find1(rs,mid+1,R,x);
}
int find2(int u,int L,int R,int x) {
   if(L==R) return tr[u].smn>1?-1:x;
   pushdown(u);
   if(x> mid) {
      if(R==x) {
         if(tr[rs].smn>1) return find2(ls,L,mid,mid);
         else return find2(rs,mid+1,R,x);
      } else {
         int p=find2(rs,mid+1,R,x);
         if(!~p) return find2(ls,L,mid,mid);
         else return p;
      }
   } else return find2(ls,L,mid,x);
}
Brack query1(int u,int L,int R,int l,int r) {
   if(l<=L&&R<=r) return tr[u].mn1;
   pushdown(u);
   if(r<=mid) return query1(ls,L,mid,l,r);
   if(l> mid) return query1(rs,mid+1,R,l,r);
   return min(query1(ls,L,mid,l,r),query1(rs,mid+1,R,l,r));
}
Brack query2(int u,int L,int R,int l,int r) {
   if(l<=L&&R<=r) return tr[u].mn2;
   pushdown(u);
   if(r<=mid) return query2(ls,L,mid,l,r);
   if(l> mid) return query2(rs,mid+1,R,l,r);
   return min(query2(ls,L,mid,l,r),query2(rs,mid+1,R,l,r));
}
#undef ls
#undef rs
#undef mid
}
ll res=0;
void change(int x,int k) {
   Brack ds;
   int y,p,rst;
   if(c[x]!=s[x]) res+=k-a[x];
   a[x]=k,b[x]=(c[x]?a[x]:-a[x]);
   rst=(c[x]==s[x]?a[x]:-a[x]);
   if(s[x]) {
      p=SGT::find1(1,1,n,x+1); if(!~p) p=n+1;
      ds=SGT::query2(1,1,n,1,p-1);
   } else {
      p=SGT::find2(1,1,n,x-1); if(!~p) p=0;
      ds=SGT::query1(1,1,n,p+1,n);
   }
   y=ds.num,rst+=ds.data;
   if(rst<0) {
      res+=rst;
      if(s[x]) {
         s[x]=0,s[y]=1;
         SGT::update1(1,1,n,x,n,-2);
         SGT::update1(1,1,n,y,n,2);
         SGT::update2(1,1,n,x,INF,-b[x]);
         SGT::update2(1,1,n,y,b[y],INF);
      } else {
         s[x]=1,s[y]=0;
         SGT::update1(1,1,n,x,n,2);
         SGT::update1(1,1,n,y,n,-2);
         SGT::update2(1,1,n,x,b[x],INF);
         SGT::update2(1,1,n,y,INF,-b[y]);
      }
   } else {
      if(s[x]) SGT::update2(1,1,n,x,b[x],INF);
      else SGT::update2(1,1,n,x,INF,-b[x]);
   }
}
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   Solve();
}
void Solve() {
   cin>>n>>Q,n<<=1;
   SGT::build(1,1,n);
   for(int i=1;i<=n;i++) cin>>b[i];
   for(int i=1;i<=n;i++) {
      char ch; cin>>ch;
      c[i]=ch=='(',s[i]=i&1;
   }
   for(int i=1;i<=n;i++) change(i,b[i]);
   printf("%lld\n",res);
   int x,d;
   while(Q--) {
      cin>>x>>d;
      change(x,d);
      printf("%lld\n",res);
   }
}