using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, q) = (c[0], c[1]);
        var s = ReadLine().ToCharArray();
        var query = NArr(q);
        var ft = new FenwickTree(n * 2);
        for (var i = 0; i + 1 < n; ++i) if (s[i] == '(' && s[i + 1] == ')') ft.Add(i * 2 + 1, 1);
        var ans = new List<long>();
        foreach (var que in query)
        {
            if (que[0] == 1)
            {
                var i = que[1] - 1;
                if (s[i] == '(')
                {
                    s[i] = ')';
                    if (i + 1 < n && s[i + 1] == ')') ft.Add(i * 2 + 1, -1);
                    if (i - 1 >= 0 && s[i - 1] == '(') ft.Add(i * 2 - 1, 1);
                }
                else
                {
                    s[i] = '(';
                    if (i + 1 < n && s[i + 1] == ')') ft.Add(i * 2 + 1, 1);
                    if (i - 1 >= 0 && s[i - 1] == '(') ft.Add(i * 2 - 1, -1);
                }
            }
            else
            {
                var l = que[1] - 1;
                var r = que[2] - 1;
                ans.Add(ft.Sum(r * 2) - ft.Sum(l * 2));
            }
        }
        WriteLine(string.Join("\n", ans));
    }
    class FenwickTree
    {
        int size;
        long[] tree;
        public FenwickTree(int size)
        {
            this.size = size;
            tree = new long[size + 2];
        }
        public void Add(int index, int value)
        {
            ++index;
            for (var x = index; x <= size; x += (x & -x)) tree[x] += value;
        }
        /// <summary>先頭からindexまでの和(include index)</summary>
        public long Sum(int index)
        {
            if (index < 0) return 0;
            ++index;
            var sum = 0L;
            for (var x = index; x > 0; x -= (x & -x)) sum += tree[x];
            return sum;
        }
        /// <summary>Sum(x) >= value となる最小のxを求める</summary>
        // 各要素は非負であること
        public int LowerBound(long value)
        {
            if (value < 0) return -1;
            var x = 0;
            var b = 1;
            while (b * 2 <= size) b <<= 1;
            for (var k = b; k > 0; k >>= 1)
            {
                if (x + k <= size && tree[x + k] < value)
                {
                    value -= tree[x + k];
                    x += k;
                }
            }
            return x;
        }
    }
}