#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <bitset>
#include <cstdio>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define lowbit(x) x&(-x)
#define pi 3.14159265358
#define lc k<<1;
#define rc k<<1|1
#define ppb push_back
#define mod 1000000007
#define fori(i,l,r) for(int i=l;i<=r;i++)
#define forj(j,l,r) for(int j=l;j<=r;j++)
using namespace std;
typedef long long ll;
typedef unsigned long long ULL;
typedef pair <int, int> pll;
const int N = 2e6 + 10;
const int P = 131;
ll cnt = 0;
ll t, n, m, ans = 0;
struct peo{
	int l, r;
}arr[N], brr[N];
void ac(){
	while (cin >> n >> m){
		string s;
		cin >> s;
		s = " " + s;
		int s1 = 0, s2 = 0;
		arr[n + 1].l = 0, arr[n + 1].r = 0;
		brr[n + 1].l = 0, brr[n + 1].r = 0;
		for (int i = 1; i <= n; i++){
			if (s[i] == '(')s1++;
			else s2++;
			arr[i].l = s1, arr[i].r = s2;
		}s1 = 0, s2 = 0;
		for (int i = n; i >= 1; i--){
			if (s[i] == '(')s1++;
			else s2++;
			brr[i].l = s1, brr[i].r = s2;
		}int a, b;
		for (int i = 1; i <= m; i++){
			cin >> a >> b;
			if (s[a] == '('&&s[b] == ')'){
				arr[a].l--, arr[a].r++;
				brr[b].l++, brr[b].r--;
				if (arr[a].l - arr[a].r + brr[b].l - brr[b].r != 0 || ((arr[a - 1].l - arr[a - 1].r == 0) && (brr[b + 1].l - brr[b + 1].r == 0)))cout << "No\n";
				else cout << "Yes\n";
				arr[a].l++, arr[a].r--;
				brr[b].l--, brr[b].r++;
			}
			else{
				cout << "Yes\n";
			}
		}
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie();
	cout.tie();
	t = 1;
	while (t--){
		ac();
	}


}