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

n, q = map(int, input().split())
s = [' '] + list(input()) + [' ']
fw = Bit(n + 2)
for i in range(n + 2):
    if s[i] == '(' and s[i + 1] == ')':
        fw.add(i + 1, 1)
for _ in range(q):
    t, *query = map(int, input().split())
    if t == 1:
        i, = query
        if s[i] == '(':
            if s[i + 1] == ')':
                fw.add(i + 1, -1)
            s[i] = ')'
            if s[i - 1] == '(':
                fw.add(i, 1)
        else:
            if s[i + 1] == '(':
                fw.add(i, -1)
            s[i] = '('
            if s[i + 1] == ')':
                fw.add(i + 1, 1)
    else:
        l, r = query
        print(fw.sum(r) - fw.sum(l))