#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

template<class S, S (*op)(S, S), S (*e)()>
struct SegTree {
 public:
  SegTree() : SegTree(0) {}
  SegTree(int n) : SegTree(vector<S>(n, e())) {}
  SegTree(int n, S v) : SegTree(vector<S>(n, v)) {}
  SegTree(const vector<S>& v) : _n(int(v.size())){
    lg = 0;
    while ((1U << lg) < (unsigned int)(_n)) lg++;
    sz = 1 << lg;
    d = vector<S>(2 * sz, e());
    for (int i = 0; i < _n; ++i) d[sz + i] = v[i];
    for (int i = sz-1; i >= 1; --i) {
      update(i);
    }
  }

  void set(int p, S x) {
    assert(0 <= p && p < _n);
    p += sz;
    d[p] = x;
    for (int i = 1; i <= lg; ++i) update(p >> i);
  }

  S get(int p) {
    assert(0 <= p && p < _n);
    return d[p+sz];
  }

  S prod(int l, int r) {
    assert(0 <= l && l <= r && r <= _n);
    S sml = e(), smr = e();
    l += sz, r += sz;
    while(l < r) {
      if (l & 1) sml = op(sml, d[l++]);
      if (r & 1) smr = op(d[--r], smr);
      l >>= 1, r >>= 1;
    }
    return op(sml, smr);
  }

  S all_prod() { return d[1]; }

  using F = function<bool(S)>;

  // max_{r \in [l, n]} f(prod(l, r)) == true
  int max_right(int l, const F &f) {
    assert(0 <= l && l <= _n);
    assert(f(e()));
    if (l == _n) return _n;
    l += sz;
    S v = e();
    do {
      while(l % 2 == 0) l >>= 1;
      if (!f(op(v, d[l]))) {
        while(l < sz) {
          l *= 2;
          if (f(op(v, d[l]))) {
            v = op(v, d[l]);
            ++l;
          }
        }
        return l - sz;
      }
      v = op(v, d[l]);
      ++l;
    } while((l & -l) != l);
    return _n;
  }

  // min_{l \in [0, r]} f(prod(l, r)) == true
  int min_left(int r, const F &f) {
    assert(0 <= r && r <= _n);
    assert(f(e()));
    if (r == 0) return 0;
    r += sz;
    S v = e();
    do {
      --r;
      while(r > 0 && (r % 2)) r >>= 1;
      if (!f(op(d[r], v))) {
        while(r < sz) {
          r = r*2+1;
          if (f(op(d[r], v))) {
            v = op(d[r], v);
            --r;
          }
        }
        return r+1-sz;
      }
      v = op(d[r], v);
    } while((r & -r) != r);
    return 0;
  }

 private:
  int _n, sz, lg;
  vector<S> d;

  void update(int k) {d[k] = op(d[2*k], d[2*k+1]);}
};

struct S {
  int c1, c2, val;
};
S op(S a, S b) {
  if (a.c1 == -1) return b;
  if (b.c1 == -1) return a;
  int x = min(a.c1, b.c2);
  return S{a.c1+b.c1-x, a.c2+b.c2-x, a.val+b.val+2*x};
}
S e() { return S{-1,-1,-1}; }

int main() {
  int n, q; string s;
  cin >> n >> q >> s;
  vector<S> v(n);
  rep(i,0,n) {
    if (s[i] == '(') v[i] = S{1, 0, 0};
    else v[i] = S{0, 1, 0};
  }
  SegTree<S,op,e> seg(v);
  while(q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int x, y;
      cin >> x >> y;
      --x;
      if (y == 1) seg.set(x, S{1, 0, 0});
      else seg.set(x, S{0, 1, 0});
    } else {
      int l, r;
      cin >> l >> r;
      --l;
      cout << seg.prod(l, r).val << endl;
    }
  }
  return 0;
}