#include<bits/stdc++.h>
#define R register
#define ll long long
#define inf 1e18
#define fp(i,a,b) for(R int i=(a),I=(b)+1;i<I;i)
#define fd(i,a,b) for(R int i=(a),I=(b)-1;i>I;--i)
#define go(u) for(int i=head[u],v=e[i].v;i;i=e[i].nx,v=e[i].v)
template<class T>inline bool cmin(T&a,const T&b){return a>b?a=b,1:0;}
template<class T>inline bool cmax(T&a,const T&b){return a<b?a=b,1:0;}
using namespace std;
char buf[1<<21],*p1=buf,*p2=buf;
inline char getc(){return p1p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1p2)?EOF:*p1;}
ll read(){
R ll res,f=1;R char ch;
while((ch=getc())>'9'||ch<'0')(ch=='-')&&(f=-1);
for(res=ch-'0';(ch=getc())>='0'&&ch<='9';res=res10+ch-'0');
return resf;
}
const int N=2e5+5;
struct node{
int x,y;
node(){}
node(R int xx,R int yy):x(xx),y(yy){}
inline node operator -(const node &b)const{return node(x-b.x,y-b.y);}
inline ll operator (const node &b)const{return 1llxb.y-1llyb.x;}
inline bool operator <(const node &b)const{return x==b.x?y<b.y:x<b.x;}
}p[N],st[N];
struct query{
ll a,b,c;node p;int id;
query(){}
query(R ll a,R ll b,R ll c,R node P,R int Id):a(a),b(b),c(c),p(P),id(Id){}
}c[N],las[N];
struct qwq{ll a,b,c;int op,id;}q[N];
inline bool cmp1(const query &x,const query &y){return x.py.p>=0;}
inline bool cmp2(const query &x,const query &y){return x.py.p<=0;}
int ans[N];ll mn[N],mx[N],vc[N],maxn,minn;int op[N],n,m,tot,top,cnt,t;
inline void upd(R int id,R int x,R int y){
R ll val=las[id].ax+las[id].by-las[id].c;
cmax(mx[id],val),cmin(mn[id],val);
}
void solve(int l,int r){
if(l==r)return;
int mid=(l+r)>>1;
solve(l,mid),solve(mid+1,r),top=cnt=tot=0;
fp(i,l,mid)if(q[i].op&1)p[++tot]=node(q[i].a,q[i].b);
fp(i,mid+1,r)if(q[i].op&2)c[++cnt]=query(q[i].a,q[i].b,q[i].c,node(q[i].b,-q[i].a),q[i].id);
if(!tot||!cnt)return;
sort(p+1,p+1+tot),st[top=1]=p[1];
fp(i,2,tot){
while(top>1&&(p[i]-st[top-1])(st[top]-st[top-1])>=0)--top;
st[++top]=p[i];
}
sort(c+1,c+1+cnt,cmp1);
for(R int i=1,j=1;i<=top;++i){
while(j<=cnt&&(i+1>top||(c[j].p*(st[i+1]-st[i]))>=0))
upd(c[j].id,st[i].x,st[i].y),++j;
}
st[top=1]=p[1];
fp(i,2,tot){
while(top>1&&(p[i]-st[top-1])(st[top]-st[top-1])<=0)--top;
st[++top]=p[i];
}
sort(c+1,c+1+cnt,cmp2);
for(R int i=1,j=1;i<=top;++i){
while(j<=cnt&&(i+1>top||c[j].p(st[i+1]-st[i])<=0))
upd(c[j].id,st[i].x,st[i].y),++j;
}
}
int main(){
n=read(),m=read(),maxn=-inf,minn=inf;
fp(i,1,n)q[i].op=1,q[i].a=read(),q[i].b=read(),cmax(maxn,q[i].a),cmin(minn,q[i].a);
t=n;
fp(i,1,m)ans[i]=-1;
fp(i,1,m){
++t,op[i]=q[t].op=read();
if(q[t].op&1)q[t].a=read(),q[t].b=read(),cmax(maxn,q[t].a),cmin(minn,q[t].a);
else{
q[t].a=read(),q[t].b=read(),q[t].c=read();
if(!q[t].b)ans[i]=(-1.0q[t].c/q[t].a<minn||-1.0q[t].c/q[t].a>maxn),--t;
else{
if(q[t].b<0)q[t].a=-q[t].a,q[t].b=-q[t].b,q[t].c=-q[t].c;
mn[i]=inf,mx[i]=-inf,q[t].id=i;
las[i].a=q[t].a,las[i].b=q[t].b,las[i].c=q[t].c;
}
}
}
solve(1,t);
fp(i,1,t)if(q[i].op&2)ans[q[i].id]=(mx[q[i].id]<0||mn[q[i].id]>0);
fp(i,1,m)if(op[i]&2)puts(ans[i]?"YES":"NO");
return 0;
}
