#include <cstdio>
#include <map>
using namespace std;

const int MAXW=500005;

map<int,int> sum[MAXW];

int W;

void add(int x,int y,int val)
{
	for(;x<=W;x+=x&(-x))
		for(int j=y;j<=W;j+=j&(-j))
			sum[x][j]+=val;
}

map<int,int>::iterator it;
int getsum(int x,int y)
{
	if (!x || !y)
		return 0;
	int ret=0;
	for(;x>0;x-=x&(-x))
		if (sum[x].size())
			for(int j=y;j>0;j-=j&(-j))
			{
				it=sum[x].find(j);
				if (it!=sum[x].end())
					ret+=it->second;
			}
	return ret;
}

int main()
{
	freopen("locust.in","r",stdin);
	freopen("locust.out","w",stdout);
	scanf("%d",&W);
	int N;
	scanf("%d",&N);
	for(int i=0;i<N;i++)
	{
		int con;
		scanf("%d",&con);
		if (con==1)
		{
			int x,y,z;
			scanf("%d%d%d",&x,&y,&z);
			add(x,y,z);
		}
		else
		{
			int x1,y1,x2,y2;
			scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			int t=getsum(x2,y2)-getsum(x1-1,y2)-getsum(x2,y1-1)+getsum(x1-1,y1-1);
			printf("%d\n",t);
		}
	}
	return 0;
}