#include <bits/stdc++.h>
using namespace std;
const int N=100000+5;
int n,m;
int l[N]={0};
bool ok[N]={0};
int lowbit(int x){
    return x&(-x);
}
void add(int x,int y){
    for (int i=x;i<=n+1;i+=lowbit(i)){
        l[i]+=y;
    }
    return ;
}
int getsum(int x,int y){
    int t=0;
    for (int i=y;i>0;i-=lowbit(i))t+=l[i];
    for (int i=x;i>0;i-=lowbit(i))t-=l[i];
    return t;
}
int main(){
    freopen ("lakee.in","r",stdin);
    freopen ("lakee.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;i++){
        int f,a,b;
        scanf("%d%d%d",&f,&a,&b);
        if (a>b)swap(a,b);
        if (f==0){
            if (a==1&&b==n)b=n+1;
            if (ok[b]==0){
                ok[b]=1;add(b,1);
            } 
            else{
                ok[b]=0;add(b,-1);
            }
        }
        else{
            if (getsum(a,b)==0){
                printf("YES\n");
                continue;
            }
            if (getsum(0,a)==0&&getsum(b,n+1)==0){
                printf("YES\n");
                continue;
            }
            printf("NO\n");
        }
    }
    return 0;
}