class Bit:
    """1-indexed"""

    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def _sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def sum(self, i, j):
        """閉区間[i, j]"""
        return self._sum(j) - self._sum(i - 1)

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


N, Q = map(int, input().split())
S = list(input())
B = Bit(N - 1)
for i in range(N - 1):
    if S[i] == "(" and S[i + 1] == ")":
        B.add(i + 1, 1)
for _ in range(Q):
    query = tuple(map(int, input().split()))
    if query[0] == 1:
        i = query[1] - 1
        if S[i] == "(":
            S[i] = ")"
            if i > 0 and S[i - 1] == "(":
                B.add(i, 1)
            if S[i + 1] == ")":
                B.add(i + 1, -1)
        else:
            S[i] = "("
            if i > 0 and S[i - 1] == "(":
                B.add(i, -1)
            if S[i + 1] == ")":
                B.add(i + 1, 1)
    else:
        _, l, r = query
        print(B.sum(l, r - 1))