/* -*- coding: utf-8 -*-
 *
 * 3652.cc:  No.3652 Range Bracket Sequence - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

struct Elm {
  int c0, c1, s;
  Elm(int _c0 = 0, int _c1 = 0, int _s = 0): c0(_c0), c1(_c1), s(_s) {}

  Elm operator+(const Elm &e) {
    int d = min(c0, e.c1);
    return Elm(c0 + e.c0 - d, c1 + e.c1 - d, s + e.s + d);
  }
};

template <typename T>
struct SegTreeSum {
  int e2;
  vector<T> nodes;
  T defv;
  SegTreeSum() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
    }
  }

  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};

/* global variables */

char s[MAX_N + 4];
SegTreeSum<Elm> st;

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d%s", &n, &qn, s);

  st.init(n, Elm());
  for (int i = 0; i < n; i++)
    st.seti(i, (s[i] == '(') ? Elm(1, 0, 0) : Elm(0, 1, 0));
  st.setall();

  while (qn--) {
    int op, l, r;
    scanf("%d%d%d", &op, &l, &r), l--;

    if (op == 1) {
      st.set(l, (r == 1) ? Elm(1, 0, 0) : Elm(0, 1, 0));
    }
    else {
      auto e = st.sum_range(l, r);
      printf("%d\n", e.s * 2);
    }
  }

  return 0;
}