#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
	int n,q;
	cin>>n>>q;
	set<int> x,y;
	for(int i=0;i<q;i++){
		int op;
		cin>>op;
		if(op==1){
			int rx,ry;
			cin>>rx>>ry;
			x.insert(rx);
			y.insert(ry);
		}
		if(op==2){
			int rx,ry;
			cin>>rx>>ry;
			x.erase(rx);
			y.erase(ry);
		}
		if(op==3){
			int x1,y1,x2,y2;
			cin>>x1>>y1>>x2>>y2;
			bool okx=true,oky=true;
			int disx=distance(lower_bound(x.begin(),x.end(),x1),upper_bound(x.begin(),x.end(),x2));
			int disy=distance(lower_bound(y.begin(),y.end(),y1),upper_bound(y.begin(),y.end(),y2));
			if(disx!=(x2-x1+1))okx=false;
			if(disy!=(y2-y1+1))oky=false;
			if(okx||oky){
				cout<<"Yes\n";
			}else{
				cout<<"No\n";
			}
		}
	}
}