#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

struct S {
  int sm, mn;
};
S op(S x, S y) { return S{x.sm + y.sm, min(x.mn, x.sm + y.mn)}; }
constexpr int INF = 1001001001;
S e() { return {0, INF}; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  segtree<S, op, e> seg([&]() {
    vector<S> init(n);
    rep(i, n) {
      char c;
      cin >> c;
      S s = c == '(' ? S{1, 0} : S{-1, -1};
      init[i] = s;
    }
    return init;
  }());
  rep(_, q) {
    int t, a, b;
    cin >> t >> a >> b;
    if (t == 1) {
      S s = b == 1 ? S{1, 0} : S{-1, -1};
      seg.set(a-1, s);
    } else {
      a--;
      auto [sm, mn] = seg.prod(a, b);
      int rest = -mn + (sm - mn);
      cout << b-a - rest << '\n';
    }
  }
}