import sys
input = sys.stdin.readline


class FenwickTree(object):
    def __init__(self, n):
        self.n = n
        self.log = n.bit_length()
        self.data = [0] * n
        self.raw = [0] * n

    def __sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s

    def get(self, i):
        return self.raw[i]

    def add(self, p, x):
        """ a[p] += xを行う"""
        self.raw[p] += x
        p += 1
        while p <= self.n:
            self.data[p - 1] += x
            p += p & -p

    def update(self, p, x):
        self.add(p, x - self.get(p))

    def sum(self, l, r):
        """a[l] + a[l+1] + .. + a[r-1]を返す"""
        return self.__sum(r) - self.__sum(l)

    def lower_bound(self, x):
        """a[0] + a[1] + .. a[i] >= x となる最小のiを返す"""
        if x <= 0:
            return -1
        i = 0
        k = 1 << self.log
        while k:
            if i + k <= self.n and self.data[i + k - 1] < x:
                x -= self.data[i + k - 1]
                i += k
            k >>= 1
        return i

    def __repr__(self):
        res = [self.sum(i, i+1) for i in range(self._n)]
        return " ".join(map(str, res))


N, Q = map(int, input().split())
S = ["()".index(s) for s in input().rstrip()]
query = tuple(tuple(map(int, input().split())) for _ in range(Q))

bit = FenwickTree(N)
for i in range(N-1):
    if S[i] == 1 and S[i+1] == 0:
        bit.add(i, 1)

for flag, *arg in query:
    if flag == 1:
        i = arg[0] - 1
        S[i] = 1 - S[i]
        if i > 0:
            if S[i-1] == 1 and S[i] == 0:
                bit.update(i, 1)
            else:
                bit.update(i, 0)
        if i + 1 < N:
            if S[i] == 1 and S[i+1] == 0:
                bit.update(i+1, 1)
            else:
                bit.update(i+1, 0)
    else:
        l, r = arg
        l -= 1
        r -= 1
        tmp = bit.sum(l, r + 1)
        if S[l] == 0:
            tmp += 1
        if S[r] == 1:
            tmp += 1
        print(tmp - 1)