#include<bits/stdc++.h>
#define N 1000005
#define M 300005
#define ls(x) x<<1
#define rs(x) x<<1|1
#define db double
#define ui unsigned
#define ul unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define fo(i,l,r) for(int i=(l);i<=(r);i++)
#define rf(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int T,n,m,k,last,ans,op,x,y,z;
int tl[N<<2],tr[N<<2];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void ckmax(int &x,int y){if(y>x)x=y;}
void ckmin(int &x,int y){if(y<x)x=y;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int fp(int a,int n,int mod){
	int ans=1;
	while(n){
		if(n&1)ans=ans*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return ans;
}
int sub(int x,int y){return x>y?x-y:y-x;}
int ab(int x){return x<0?-x:x;}
int po(int x){return x*x;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum; 
}
void pu(int x){
	tl[x]=min(tl[ls(x)],tl[rs(x)]);
	tr[x]=max(tr[ls(x)],tr[rs(x)]);
}
void bd(int l,int r,int x){
	tl[x]=n+1;tr[x]=0;
	if(l==r)return;
	int mid=l+r>>1;
	bd(l,mid,ls(x));bd(mid+1,r,rs(x));
}
void ud(int l,int r,int s,int x,int k){
	if(l==r){tl[x]=tr[x]=k;return;}
	int mid=l+r>>1;
	if(s<=mid)ud(l,mid,s,ls(x),k);
	else ud(mid+1,r,s,rs(x),k);
	pu(x);
}
pair<int,int>gs(int l,int r,int sl,int sr,int x){
	if(sl<=l&&r<=sr)return make_pair(tl[x],tr[x]);
	int mid=l+r>>1,al=n+1,ar=0;
	if(sl<=mid){
		auto xx=gs(l,mid,sl,sr,ls(x));
		ckmin(al,xx.first);
		ckmax(ar,xx.second);
	}
	if(mid<sr){
		auto xx=gs(mid+1,r,sl,sr,rs(x));
		ckmin(al,xx.first);
		ckmax(ar,xx.second);
	}
	return make_pair(al,ar);
}
signed main(){
	freopen("circle.in","r",stdin);freopen("circle.out","w",stdout);
	n=read();m=read();
	bd(1,n,1);
	while(m--){
		x=read();y=read();
		if(x>y)swap(x,y);
		auto xx=gs(1,n,x,y,1);
		if(x<xx.first&&xx.second<y){
			ud(1,n,x,1,y);
			ud(1,n,y,1,x);
			printf("Yes\n");
		}
		else printf("No\n");
	}
	return 0;
}