#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
inline void chkmax(int &a,int b){a=max(a,b);}
inline void chkmin(int &a,int b){a=min(a,b);}
inline int re()
{
    char c=getchar();
    int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
const int N=1000010;
int n,q;
namespace Segmax
{
    #define ls (p<<1)
    #define rs (p<<1|1)
    int tag[N<<2];
    void build(int l=1,int r=n,int p=1)
    {
        tag[p]=1;if(l==r) return;
        int mid=(l+r)>>1;
        build(l,mid,ls);build(mid+1,r,rs);
        return;
    }
    void checkmax(int ql,int qr,int z,int l=1,int r=n,int p=1)
    {
        if(ql<=l&&r<=qr){chkmax(tag[p],z);return;}
        int mid=(l+r)>>1;
        if(ql<=mid) checkmax(ql,qr,z,l,mid,ls);
        if(mid<qr) checkmax(ql,qr,z,mid+1,r,rs);
        return;
    }
    int query(int pos,int l=1,int r=n,int p=1)
    {
        if(pos==l&&r==pos) return tag[p];
        int mid=(l+r)>>1;
        if(pos<=mid) return max(query(pos,l,mid,ls),tag[p]);
        else return max(query(pos,mid+1,r,rs),tag[p]);
    }
}
namespace Segmin
{
    #define ls (p<<1)
    #define rs (p<<1|1)
    int tag[N<<2];
    void build(int l=1,int r=n,int p=1)
    {
        tag[p]=n;if(l==r) return;
        int mid=(l+r)>>1;
        build(l,mid,ls);build(mid+1,r,rs);
        return;
    }
    void checkmin(int ql,int qr,int z,int l=1,int r=n,int p=1)
    {
        if(ql<=l&&r<=qr){chkmin(tag[p],z);return;}
        int mid=(l+r)>>1;
        if(ql<=mid) checkmin(ql,qr,z,l,mid,ls);
        if(mid<qr) checkmin(ql,qr,z,mid+1,r,rs);
        return;
    }
    int query(int pos,int l=1,int r=n,int p=1)
    {
        if(pos==l&&r==pos) return tag[p];
        int mid=(l+r)>>1;
        if(pos<=mid) return min(query(pos,l,mid,ls),tag[p]);
        else return min(query(pos,mid+1,r,rs),tag[p]);
    }
}
int main()
{
    freopen("circle.in","r",stdin);
    freopen("circle.out","w",stdout);
    n=re();q=re();
    Segmin::build();Segmax::build();
    for(int i=1;i<=q;i++)
    {
        int l=re(),r=re();if(l>r) swap(l,r);
        if(Segmin::query(l)<r||Segmax::query(r)>l){printf("No\n");continue;}
        printf("Yes\n");
        Segmin::checkmin(l,r,r);Segmax::checkmax(l,r,l);
    }
    return 0;
}