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

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    int N, Q, ans = 0;
    string S;
    cin >> N >> Q >> S;
    vector<int> q(Q), x(Q), y(Q);
    REP(i, Q) {
        cin >> q[i];
        if (q[i] == 1) cin >> x[i];
        else cin >> x[i] >> y[i];
    }
    REP(i, N - 1) {
        ans += S[i] == '(' && S[i + 1] == ')';
    }
    REP(i, Q) {
        if (q[i] == 1) {
            if (x[i] == 1) {
                if (S[0] == '(' && S[1] == ')') ans--;
                if (S[0] == ')' && S[1] == ')') ans++;
            } else if (x[i] == N) {
                if (S[N - 2] == '(' && S[N - 1] == ')') ans--;
                if (S[N - 2] == '(' && S[N - 1] == '(') ans++;
            } else {
                if (S.substr(x[i] - 2, 3) == "(((") ans++;
                if (S.substr(x[i] - 2, 3) == ")))") ans++;
                if (S.substr(x[i] - 2, 3) == "()(") ans--;
                if (S.substr(x[i] - 2, 3) == ")()") ans--;
            }
            if (S[i - 1] == ')') S[i - 1] = '(';
            else S[i - 1] = ')';
        } else {
            cout << ans << endl;
        }
    }
}