#include <iostream>
#include <fstream>

using namespace std;

int a[2001][2001],i,j,k,l;
int m,n,x,y,p,q;

int main()
{
	ifstream fin("locust.in");
	ofstream fout("locust.out");
	
	fin>>m>>n;
	
	for (i=1;i<=n;i++)
	{
		fin>>l;
		if (l==1)
		{
			fin>>x>>y>>q;
			for (j=x;j<=m;j++)
				for (k=y;k<=m;k++)
					a[j][k]+=q;
		}
		else
		{
			fin>>x>>y>>p>>q;
			fout<<a[p][q]-a[p][y-1]-a[x-1][q]+a[x-1][y-1]<<endl;
		}
	}
	
	fin.close();
	fout.close();
	return 0;
	
}