import sys
input = sys.stdin.readline

N,Q=list(map(int,input().split()))
A=input().strip()

def seg_function(x,y): # Segment treeで扱うfunction
    x0,x1,x2=x
    y0,y1,y2=y

    MIN=min(x0,y1)

    z2=x2+y2+MIN*2
    z0=x0+y0-MIN
    z1=x1+y1-MIN
    return z0,z1,z2

seg_el=1<<(N.bit_length()) # Segment treeの台の要素数
SEG=[(0,0,0) for i in range(2*seg_el)] # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化

for i in range(N): # Aを対応する箇所へupdate
    if A[i]=="(":
        SEG[i+seg_el]=(1,0,0)
    else:
        SEG[i+seg_el]=(0,1,0)

for i in range(seg_el-1,0,-1): # 親の部分もupdate
    SEG[i]=seg_function(SEG[i*2],SEG[i*2+1])

def update(n,x,seg_el): # A[n]をxへ更新
    i=n+seg_el
    SEG[i]=x
    i>>=1 # 子ノードへ
    
    while i!=0:
        SEG[i]=seg_function(SEG[i*2],SEG[i*2+1])
        i>>=1
        
def getvalues(l,r): # 区間[l,r)に関するseg_functionを調べる
    L=l+seg_el
    R=r+seg_el
    ANS1=(0,0,0)
    ANS2=(0,0,0)

    while L<R:
        if L & 1:
            ANS1=seg_function(ANS1, SEG[L])
            L+=1

        if R & 1:
            R-=1
            ANS2=seg_function(SEG[R], ANS2)
        L>>=1
        R>>=1

    return seg_function(ANS1, ANS2)

for tests in range(Q):
    com,x,y=list(map(int,input().split()))

    if com==1:
        if y==1:
            update(x-1,(1,0,0),seg_el)
        else:
            update(x-1,(0,1,0),seg_el)
    else:
        ANS=getvalues(x-1,y)

        print(ANS[2])