#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 #define int long long

 #define maxn 4096+10

 #define INF 2147483647/2-1

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

     for(; !isdigit(c); c=getchar()) if(c=='-') f=;

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(int x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int n,m;

 int tree[maxn][maxn];

 inline int lowbit(int num)

 {

     return num&-num;

 }

 inline void build(int sx,int sy,int num)

 {

     for(int i=sx;i<=n;i+=lowbit(i))

         for(int j=sy;j<=m;j+=lowbit(j))

             tree[i][j]+=num;

 }

 inline int ask(int sx,int sy)

 {

     int ans=;

     for(int i=sx;i>=;i-=lowbit(i))

         for(int j=sy;j>=;j-=lowbit(j))

             ans+=tree[i][j];

     return ans;

 }

 signed main()

 {

     n=read();m=read();

     int in=;

     while(scanf("%d",&in)!=EOF)

     {

         if(in==)

         {

             int x=read(),y=read(),k=read();

             build(x,y,k);

         }

         if(in==)

         {

             int a=read(),b=read(),c=read(),d=read();

             write(ask(c,d)-ask(a-,b-));

             printf("\n");

         }

     }

     return ;

 }