ABC 223

void solve() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N, Q;
    string S;
    cin >> N >> Q >> S;

    using P = pair<ll, ll>;
    auto op = [](P a, P b) -> P {
        ll m = min(a.second, b.first);
        return {a.first + b.first - m, b.second + a.second - m};
    };

    auto e = []() -> P {
        return {0, 0};
    };

    segtree<P, op, e> seg(N);
    rep(i, N) {
        if (S[i] == ')')
            seg.set(i, {1, 0});
        else
            seg.set(i, {0, 1});
    }

    while (Q--) {
        ll t, l, r;
        cin >> t >> l >> r;
        l--, r--;
        if (t == 1) {
            P left = seg.get(l), right = seg.get(r);
            swap(left, right);
            seg.set(l, left);
            seg.set(r, right);
        } else {
            P ret = seg.prod(l, r + 1);
            yesno(ret.first == 0 && ret.second == 0);
        }
    }
}

struct P {
    ll sum, mi;
};

P op(P a, P b) {
    return {a.sum + b.sum, min(a.mi, a.sum + b.mi)};
}

P e() {
    return {0, 0};
}

void solve() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N, Q;
    string S;
    cin >> N >> Q >> S;

    segtree<P, op, e> seg(N);
    rep(i, N) {
        if (S[i] == '(')
            seg.set(i, {1, 0});
        else
            seg.set(i, {-1, -1});
    }

    while (Q--) {
        int t;
        cin >> t;
        if (t == 1) {
            ll l, r;
            cin >> l >> r;
            l--, r--;
            P a = seg.get(l), b = seg.get(r);
            swap(a, b);
            seg.set(l, a), seg.set(r, b);
        } else {
            ll l, r;
            cin >> l >> r;
            l--;
            P p = seg.prod(l, r);
            yesno(p.sum == 0 && p.mi == 0);
        }
    }
}