#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int calc(char lc, char rc) {
	if (('(' == lc) && ('(' == rc))return 2;
	else if (('(' == lc) && (')' == rc))return 0;
	else if ((')' == lc) && (')' == rc))return 1;
	if ((')' == lc) && ('(' == rc))return 3;
}
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;
	vector<int>data(n - 1), v(n - 1, 0);
	rep(i, n - 1) data[i] = calc(s[i], s[i + 1]);
	rep(i, n - 1)if (0 == data[i])v[i] = 1;
	segtree<int, op, e>seg(v);
	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			int x; cin >> x; x--;
			char c = s[x];
			if ('(' == c)s[x] = ')';
			else s[x] = '(';
			if (0 != x) {
				data[x - 1] = calc(s[x - 1], s[x]);
				if (0 == data[x - 1])seg.set(x - 1, 1);
				else seg.set(x - 1, 0);
			}
			if ((n - 1) != x) {
				data[x] = calc(s[x], s[x + 1]);
				if (0 == data[x])seg.set(x, 1);
				else seg.set(x, 0);
			}
		}
		else {
			int l, r; cin >> l >> r; l--; r--;
			cout << seg.prod(l, r) << endl;
		}
	}
	return 0;
}