mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    class Bit:
        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 add(self, i, x):
            while i <= self.size:
                self.tree[i] += x
                i += i & -i

        def lower_bound(self, w):
            if w <= 0:
                return 0
            x = 0
            k = 1 << (self.size.bit_length() - 1)
            while k:
                if x + k <= self.size and self.tree[x + k] < w:
                    w -= self.tree[x + k]
                    x += k
                k >>= 1
            return x + 1

    N, Q = map(int, input().split())
    bit = Bit(N)
    S = input().rstrip('\n')
    S = list(S)
    for i in range(N - 1):
        if S[i] == "(" and S[i+1] == ")":
            bit.add(i + 1, 1)

    for _ in range(Q):
        q = list(map(int, input().split()))
        if q[0] == 1:
            i = q[1]
            if S[i-1] == "(":
                S[i-1] = ")"
                if i != N:
                    if S[i] == ")":
                        bit.add(i, -1)
                if i != 1:
                    if S[i-2] == "(":
                        bit.add(i-1, 1)
            else:
                S[i-1] = "("
                if i != N:
                    if S[i] == ")":
                        bit.add(i, 1)
                if i != 1:
                    if S[i-2] == "(":
                        bit.add(i-1, -1)
        else:
            l, r = q[1:]
            if l == r:
                print(0)
                continue
            if l == 1:
                print(bit.sum(r - 1))
            else:
                print(bit.sum(r - 1) - bit.sum(l - 1))


if __name__ == '__main__':
    main()