import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int q = sc.nextInt();
        char[] parens = ("X" + sc.next() + "X").toCharArray();
        BinaryIndexedTree bit = new BinaryIndexedTree(n + 2);
        for (int i = 1; i <= n; i++) {
            if (parens[i] == ')' && parens[i - 1] == '(') {
                bit.add(i, 1);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();
            if (type == 1) {
                int idx = sc.nextInt();
                if (parens[idx] == '(') {
                    parens[idx] = ')';
                    if (parens[idx - 1] == '(') {
                        bit.add(idx, 1);
                    }
                    if (parens[idx + 1] == ')') {
                        bit.add(idx + 1, -1);
                    }
                } else {
                    parens[idx] = '(';
                    if (parens[idx + 1] == ')') {
                        bit.add(idx + 1, 1);
                    }
                    if (parens[idx - 1] == '(') {
                        bit.add(idx, -1);
                    }
                }
            } else {
                int left = sc.nextInt();
                int right = sc.nextInt();
                sb.append(bit.getSum(left + 1, right)).append("\n");
            }
        }
        System.out.print(sb);
    }
}
class BinaryIndexedTree {
    int size;
    int[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new int[size];
    }
    
    public void add(int idx, int value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] += value;
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public int getSum(int from, int to) {
        return getSum(to) - getSum(from - 1);
    }
    
    public int getSum(int x) {
        int mask = 1;
        int ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans += tree[x];
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}

class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}