#include<iostream>
#include<string.h>
#include<stdio.h>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<math.h>
#include<set>
#include<bitset>
#include<deque>
#include<unordered_map>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int>PII;
const int N=1e5+10,M=5e2+10;
int sum[N],sum1[N],sum2[N];

signed main(){
	ios::sync_with_stdio(false);
	cin.tie();
	cout.tie();
	int n,m;
	while(cin>>n>>m){
		string s;
		cin>>s;
		s=" "+s;
		int ll=s.length();
		int f=1,g=1;
		for(int i=1;i<ll;i++){
			if(s[i]=='(') sum[i]=sum[i-1]+1;
			else sum[i]=sum[i-1]-1;
			if(sum[i]<0) g=0;
			if(sum[i]<=-3) f=0;
			if(sum[i]<=1){
				sum1[i]=sum1[i-1]+1;
				if(sum[i]==-1 || sum[i]==-2) sum2[i]=sum2[i-1]+1;
				else{
					sum2[i]=sum2[i-1];
				}
			}
			else{
				sum1[i]=sum1[i-1];
				sum2[i]=sum2[i-1];				
			}
		}
//		for(int i=1;i<ll;i++) cout<<sum[i]<<" "<<sum1[i]<<" "<<sum2[i]<<endl;
		if(sum[ll-1]!=0) f=0;
		if(f){
			for(int i=1;i<=m;i++){
				int l,r;
				cin>>l>>r;
				if(s[l]==s[r]){
					if(g==0) cout<<"No\n";
					else cout<<"Yes\n";
				}
				else{
					int flag=1;
					if(sum2[l-1]!=0 || sum2[ll-1]-sum2[r-1]!=0) flag=0;
					if(s[l]=='('){
						if(sum1[r-1]-sum1[l-1]!=0) flag=0;
					}
					if(flag==1) cout<<"Yes\n";
					else cout<<"No\n";
				}
			}
		}
		else{
			for(int i=1;i<=m;i++){
				int l,r;
				cin>>l>>r;
				cout<<"No\n";
			}
		}
	}
	return 0;
}
//18 3
//((())))()()(()(())
//7 11
//7 12
//7 8
//18 1
//((()))))()((()(())
//7 11