//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

int op(int a,int b){
  return a+b;
}
int e(){
  return 0;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n,q;
  cin>>n>>q;

  string s;
  cin>>s;

  vi a(n);
  rep(i,0,n){
    if(s[i]=='('){
      a[i]=0;
    }
    else{
      a[i]=1;
    }
  }

  vi sc(n-1);
  rep(i,0,n-1){
    if(a[i]==1&&a[i+1]==0){
      sc[i]=1;
    }
    else{
      sc[i]=0;
    }
  }

  segtree<int,op,e> seg(sc);

  while(q--){
    int x;
    cin>>x;

    if(x==1){
      int id;
      cin>>id;
      id--;

      a[id]=1-a[id];

      if(id<n-1){
        if(a[id]==1&&a[id+1]==0){
          seg.set(id,1);
        }
        else{
          seg.set(id,0);
        }
      }
      if(0<id){
        if(a[id-1]==1&&a[id]==0){
          seg.set(id-1,1);
        }
        else{
          seg.set(id-1,0);
        }
      }
    }
    else{
      int l,r;
      cin>>l>>r;
      l--;r--;

      int p=seg.prod(l,r);
      p++;
      if(a[l]==1){
        p--;
      }
      if(a[r]==0){
        p--;
      }
      cout<<p<<endl;
    }
  }
}