class BIT:

    __all__ = ['add', 'sumrange', 'lower_left']

    def __init__(self, maxsize=10**6):
        assert (maxsize > 0)

        self._n = maxsize+1
        self._bitdata = [0]*(maxsize+1)

    def add(self, i, x):
        '''Add x to A[i] (A[i] += x) '''
        assert(0 <= i < self._n)

        pos = i+1
        while pos < self._n:
            self._bitdata[pos] += x
            pos += pos&(-pos)

    def running_total(self, i):
        ''' Return sum of (A[0] ... A[i]) '''
        assert (-1<= i < self._n)

        if i == -1:
            return 0
        returnval = 0
        pos = i+1
        while pos:
            returnval += self._bitdata[pos]
            pos -= pos & (-pos)
        return returnval

    def sumrange(self, lo=0, hi=None):
        ''' Return sum of (A[lo] ... A[hi]) '''
        if lo < 0:
            raise ValueError('lo must be non-negative')
        if hi is None:
            hi = self._n

        return self.running_total(hi) - self.running_total(lo-1)

    def lower_left(self, total):
        ''' Return min-index satisfying {sum(A0 ~ Ai) >= total}
        only if Ai >= 0 (for all i)
        '''
        if total < 0:
            return -1
        pos = 0
        k = 1<<(self._n.bit_length()-1)
        while k > 0:
            if pos+k < self._n and self._bitdata[pos+k] < total:
                total -= self._bitdata[pos+k]
                pos += k
            k //= 2
        return pos
def tentousu(lis):
  bit = BIT()
  ans = 0
  for i in range(len(lis)):
      bit.add(lis[i], 1)
      ans += i + 1 - bit.running_total(lis[i])
  return ans

N,Q=map(int,input().split())
S=input()
bit=BIT(N)
for i in range(N-1):
  if S[i]=="(" and S[i+1]==")":
    bit.add(i,1)
L=list(S)
for i in range(Q):
  A=list(map(int,input().split()))
  if A[0]==1:
    a=A[1]
    a-=1
    if L[a]=="(":
      if a!=N-1:
        if L[a+1]==")":
          bit.add(a,-1)
      if a!=0:
        if L[a-1]=="(":
          bit.add(a-1,1)
      L[a]=")"
    else:
      L[a]="("
      if a!=0:
        if L[a-1]=="(":
          bit.add(a-1,-1)
      if a!=N-1:
        if L[a+1]==")":
          bit.add(a,1)
  else:
    l,r=A[1],A[2]
    l-=1
    r-=1
    ans=bit.sumrange(l,r-1)
    print(ans)