program huangzai;
var
  i,j,k,w,n,q,x,y,c,x1,x2,y1,y2,ans:longint;
  map:array[1..2000,1..2000]of longint;
function min(a,b:longint):longint;
begin
  if a<b then
    min:=a
  else
    min:=b
end;
function max(a,b:longint):longint;
begin
  if a>b then
    max:=a
  else
    max:=b
end;
begin
  assign (input,'locust.in');
  reset (input);
  assign (output,'locust.out');
  rewrite (output);
    readln (w);
    readln (n);
    for i:=1 to n do
    begin
      read (q);
      if q=1 then
      begin
        readln (x,y,c);
        map[x,y]:=map[x,y]+c
      end
      else
      begin
        readln (x1,y1,x2,y2);
        ans:=0;
        for j:=min(x1,x2) to max(x1,x2) do
          for k:=min(y1,y2) to max(y1,y2) do
            ans:=ans+map[j,k];
        writeln (ans)
      end 
    end;
  close (input);
  close (output)
end.