#include<bits/stdc++.h>
#define reg register int
#define il inline
#define numb (ch^'0')
using namespace std;
typedef long long ll;
il void rd(int &x){char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);
}
namespace Miracle{
const int N=200000+5;
const int M=2020;
int n,len;
int mod;
struct node{int x,y1,y2;
}p[N];
int cnt;
int co[1000000+5];
struct at{int f[2*M][4*M];void add(int x,int y,int c){//swap(x,y);while(x<2010){int tmp=y;while(tmp<4010){f[x][tmp]+=c;tmp+=tmp&(-tmp);}x+=x&(-x);}}int query(int x,int y){//swap(x,y);if(x<0||y<0) return 0;++x,++y;if(x>=2*len) x=2*len;if(y>=4*len) y=4*len;int ret=0;//    cout<<" x y "<<x<<" "<<y<<endl;while(x){int tmp=y;while(tmp){ret+=f[x][tmp];tmp-=tmp&(-tmp);}x-=x&(-x);}return ret;}
}t1,t2;
int get(int x1,int y1,int x2,int y2,int c){
//    cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<" "<<c-1<<endl;if(c==1){int ret=t1.query(x2,y2)+t1.query(x1-1,y1-1)-t1.query(x1-1,y2)-t1.query(x2,y1-1);//    cout<<" ret "<<ret<<endl;return ret;}else{int ret=t2.query(x2,y2)+t2.query(x1-1,y1-1)-t2.query(x1-1,y2)-t2.query(x2,y1-1);//    cout<<" ret "<<ret<<endl;return ret;}
}
int sol(int t,int l,int r){int d=(r==len);return get(t,t+l,t+r,4*len,1)+get(0,t+l-mod,t+r-mod-d,4*len,1)+get(t-r,l-t+mod,t-1,4*len,2)+get(t-r+mod+d,l-t,mod-1,4*len,2);
}
int main(){rd(n);rd(len);int op,t,c,l,r,d;mod=2*len;while(n--){rd(op);if(op==1){rd(t);rd(c);rd(l);rd(r);rd(d);++cnt;p[cnt].x=(t-d*l+mod)%mod;p[cnt].y1=(r-l+p[cnt].x);p[cnt].y2=(r-l-p[cnt].x+mod);//    cout<<" point "<<p[cnt].x<<" "<<p[cnt].y1<<" || "<<p[cnt].y2<<endl;co[c]=cnt;t1.add(p[cnt].x+1,p[cnt].y1+1,1);t2.add(p[cnt].x+1,p[cnt].y2+1,1);}else if(op==2){rd(t);rd(l);rd(r);t%=mod;printf("%d\n",sol(t,l,r));}else{rd(t);rd(c);t1.add(p[co[c]].x+1,p[co[c]].y1+1,-1);t2.add(p[co[c]].x+1,p[co[c]].y2+1,-1);co[c]=0;}}return 0;
}}
signed main(){Miracle::main();return 0;
}/*Author: *Miracle*Date: 2019/1/8 14:12:04
*/