#include <bits/stdc++.h>
using namespace std;

template <typename T>
struct BinaryIndexedTree {
    int N;
    vector<T>bit;
    BinaryIndexedTree(){}
    BinaryIndexedTree(int x) {
        N = x;
        bit.resize(x+1);
    }
    void add(int x,T y) {
        while(x <= N) {
            bit[x] += y;
            x += x&-x;
        }
    }
    T sum(int x) {
        T res = 0;
        while(x) {
            res += bit[x];
            x -= x&-x;
        }
        return res;
    }
    inline T sum(int l, int r) {//[l,r]
        return sum(r)-sum(l-1);
    }
    inline T operator[](int k) {
        return sum(k)-sum(k-1);
    }
    int lower_bound(T w) {// left sum(i) >= w
        int x = 0;
        for (int k = 1 << __lg(N); k; k >>= 1) {
            if (x + k <= N - 1 && bit[x + k] < w) {
                w -= bit[x + k];
                x += k;
            }
        }
        return x;
    }
    int upper_bound(T w) {// left sum(i) > w
        int x = 0;
        for (int k = 1 << __lg(N); k; k >>= 1) {
            if (x + k <= N - 1 && bit[x + k] <= w) {
                w -= bit[x + k];
                x += k;
            }
        }
        return x;
    }
};

int main() {
    int N,Q;
    string S;
    cin >> N >> Q >> S;
    BinaryIndexedTree<int>bit(N);
    for(int i = 0; i+1 < N; i++) {
        if(S[i] == '(' && S[i+1] == ')') {
            bit.add(i+1,1);
        }
    }
    while (Q--) {
        int f;
        cin >> f;
        if(f == 1) {
            int a;
            cin >> a;
            a--;
            if(S[a] == '(') {
                if(a+1 < N && S[a+1] == ')') {
                    bit.add(a+1,-1);
                }
                if(a && S[a-1] == '(') {
                    bit.add(a,1);
                }
                S[a] = ')';
            }
            else {
                if(a+1 < N && S[a+1] == ')') {
                    bit.add(a+1,1);
                }
                if(a && S[a-1] == '(') {
                    bit.add(a,-1);
                }
                S[a] = '(';
            }
        }
        else {
            int l,r;
            cin >> l >> r;
            cout << bit.sum(l,r-1) << endl;
        }
    }
}