/* -*- coding: utf-8 -*-
 *
 * 1802.cc:  No.1802 Range Score Query for Bracket Sequence - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

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

  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];
SegTree<int> st;

/* subroutines */

/* main */

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

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

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

    if (op == 1) {
      int i;
      scanf("%d", &i), i--;

      if (s[i] == '(') {
	s[i] = ')';
	if (i + 1 < n && s[i + 1] == ')') st.set(i, 0);
	if (i > 0 && s[i - 1] == '(') st.set(i - 1, 1);
      }
      else { // s[i] == ')'
	s[i] = '(';
	if (i + 1 < n && s[i + 1] == ')') st.set(i, 1);
	if (i > 0 && s[i - 1] == '(') st.set(i - 1, 0);
      }
    }
    else {
      int l, r;
      scanf("%d%d", &l, &r);
      l--, r--;

      printf("%d\n", st.sum_range(l, r));
    }
  }
  
  return 0;
}