#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>

using namespace std;

const int MAXN=1005;

int n,m,i,j,k,a[MAXN][MAXN],op,X1,Y1,X2,Y2,ans,Q;

int main()
{
	freopen("locust.in","r",stdin);
	freopen("locust.out","w",stdout);
	scanf("%d%d",&n,&Q);
	while (Q--)
	{
		scanf("%d",&op);
		if (op==1)
		{
			scanf("%d%d%d",&X1,&Y1,&k);
			a[X1][Y1]+=k;
		}
		else
		{
			ans=0;
			scanf("%d%d%d%d",&X1,&Y1,&X2,&Y2);
			for (i=X1;i<=X2;i++)
				for (j=Y1;j<=Y2;j++)
					ans+=a[i][j];
			printf("%d\n",ans);
		}
	}
	return 0;
}