#include <bits/stdc++.h>

using namespace std;
#define fi first
#define se second
#define int long long
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
string s;
int f[100010];
int tree[N];

void up(int p) {
    tree[p] = min(tree[p << 1], tree[p << 1 | 1]);
}

void build(int cl, int cr, int p) {
    if (cl == cr) {
        tree[p] = f[cl];
        return;
    }
    int cm = (cl + cr) >> 1;
    build(cl, cm, p << 1);
    build(cm + 1, cr, p << 1 | 1);
    up(p);
}

int getsum(int l, int r, int cl, int cr, int p) {
    if (l <= cl && cr <= r) {
        return tree[p];
    }
    int cm = (cl + cr) >> 1;
    int cnt = 1e9;
    if (l <= cm) cnt = min(cnt, getsum(l, r, cl, cm, p << 1));
    if (cm < r) cnt = min(cnt, getsum(l, r, cm + 1, cr, p << 1 | 1));
    return cnt;
}

void solve() {
    int n, q;
    while (cin >> n >> q) {
        cin >> s;
        s = "!" + s;
        for (int i = 1, sum = 0; i <= n; i++) {
            if (s[i] == '(') {
                sum++;
            } else {
                sum--;
            }
            f[i] = sum;
        }
        build(1, n, 1);
        while (q--) {
            int l, r;
            cin >> l >> r;
            if (l > r) {
                swap(l, r);
            }
            if (s[l] == '(' && s[r] == ')') {
                int minn = getsum(l, r - 1, 1, n, 1);
                if (minn >= 2) {
                    cout << "Yes\n";
                } else {
                    cout << "No\n";
                }
            } else {
                cout << "Yes\n";
            }
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _;
    _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
}