T7

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<algorithm>
 using namespace std;
 int s,n;
 int op;
 const int maxn=2e6+;
 int c[maxn];
 struct SS
 {
     int lowbit(int x)
     {
         return x&(-x);
     }
     void add(int x,int w)
     {
         for(;x<=n;x+=lowbit(x))
         {
             c[x]+=w;
         }
     }
     int sum(int x)
     {
         int res=;
         for(;x;x-=lowbit(x))
         {
             res+=c[x];
         }
         return res;
     }
 }XX;
 int ans[maxn];

 struct node
 {
     int id;
     int op;
     int x1,x2,y1,y2;
     bool operator <(const node &x)const
     {
         if(x1==x.x1)
         {
             return op<x.op;
         }
         return x1<x.x1;
     }
 }way[maxn],a[maxn];
 void cdq(int l,int r)
 {
     if(l==r)
     {
         return ;
     }
     int mid=(l+r)>>;
     cdq(l,mid);
     cdq(mid+,r);
     int cnt=;
     for(int i=l;i<=mid;i++)
     {
         if(way[i].op==)
         {
             a[cnt++]=way[i];
         }
     }
     for(int i=mid+;i<=r;i++)
     {
         if(way[i].op==)
         {
             a[cnt++]=way[i];
             a[cnt-].op=;
             a[cnt++]=way[i];
             a[cnt-].op=;
             a[cnt-].x1=way[i].x2;
         }
     }
     sort(a,a+cnt);
     for(int i=;i<cnt;i++)
     {
         if(a[i].op==)
         {
             ans[a[i].id]-=(XX.sum(a[i].y2)-XX.sum(a[i].y1-));
         }
         else
         if(a[i].op==)
         {
             XX.add(a[i].y1,a[i].x2);
         }
         else
         {
             ans[a[i].id]+=(XX.sum(a[i].y2)-XX.sum(a[i].y1-));
         }
     }
 }
 inline int read()
 {
     int x=,f=;
     char ch=getchar();
     while(isdigit(ch)== && ch!='-')ch=getchar();
     if(ch=='-')f=-,ch=getchar();
     while(isdigit(ch))x=x*+ch-'',ch=getchar();
     return x*f;
 }
 int main()
 {
     memset(c,,sizeof(c));
     memset(ans,,sizeof(ans));
     s=read();
     n=read();
     int cnt=;
     int tot=;
     while(scanf("%d",&op)&&op!=)
     {
         if(op==)
         {
             int x,y,z;
             x=read();
             y=read();
             z=read();
             way[++cnt].op=op;
             way[cnt].id=-;
             way[cnt].x1=x;
             way[cnt].y1=y;
             way[cnt].x2=z;
             way[cnt].y2=;

         }
         if(op==)
         {
             int x1,x2,y1,y2;
             x1=read();
             y1=read();
             x2=read();
             y2=read();
             way[++cnt].op=op;
             way[cnt].id=++tot;
             way[cnt].x1=x1;
             way[cnt].x2=x2;
             way[cnt].y1=y1;
             way[cnt].y2=y2;
         }
     }
     cdq(,cnt);
     for(int i=;i<=tot;i++)
     {
         printf("%d\n",ans[i]);
         //cout<<ans[i]<<endl;
     }
     return ;
 }