class FenwickTree:
    def __init__(self, n):
        self.data = [0] * (n+10)
        self.n = (n+10)

    def add(self, p, x):
        assert 0 <= p < self.n
        p += 1
        while p < len(self.data):
            self.data[p] += x
            p += p & -p

    def sum(self, p):
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def rangesum(self, l, r):
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s


from itertools import pairwise

N, Q = map(int, input().split())
S = input()

s = list(S)
ft = FenwickTree(N+10)
# () の開き括弧のインデックスに +1 する
for i, (a, b) in enumerate(pairwise(s)):
    if a == '(' and b == ')':
        ft.add(i, 1)

for _ in range(Q):
    qs = list(map(int, input().split()))
    match qs:
        case (1, i):
            i -= 1
            match s[i]:
                case '(':
                    # ペア解消
                    if i+1 < N and s[i+1] == ')':
                        ft.add(i, -1)
                    s[i] = ')'
                    # ペア成立
                    if i > 0 and s[i-1] == '(':
                        ft.add(i-1, 1)
                case ')':
                    # ペア解消
                    if i > 0 and s[i-1] == '(':
                        ft.add(i-1, -1)
                    s[i] = '('
                    # ペア成立
                    if i+1 < N and s[i+1] == ')':
                        ft.add(i, 1)
        case (2, l, r):
            l -= 1
            r -= 1
            if s[r] == '(':
                r -= 1
            if l <= r:
                res = ft.rangesum(l, r)
                print(res)
            else:
                print(0)