#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=100100;
int n,m,zt[N],ex,h,f[N],a,b,c;
int lowbit(int x){return x&(-x);}
void add(int x,int y)
{
    if(!y) y=-1;
    h+=y;
    while(x<=n)
    {
    	f[x]+=y;
    	x+=lowbit(x);
	}
	return;
}
int find(int x)
{
	int l=0;
	while(x)
	{
		l+=f[x];
		x-=lowbit(x);
	}
	return l;
}
int main()
{
	freopen("lakee.in","r",stdin);
	freopen("lakee.out","w",stdout);
    cin>>n;n-=1;
    cin>>m;
    for(int i=1;i<=m;i++)
    {
    	cin>>a>>b>>c;
    	if(b<c) 
			swap(b,c);
    	b--;
    	if(a)
    	{
    		a=find(b)-find(c-1);
    		if(a&&h-a)
				printf("NO\n");
    		else
				printf("YES\n");
		}
		else 
		{
			if(c==1&&b==n)
			{
				h-=(ex<<1);
				h++;
				ex^=1;
				continue;
			}
			zt[c]^=1;
			add(c,zt[c]);
		}
	}
	return 0;
}