program locust;
var
  w,n,i,j,k,l,ans:longint;
  x,y,z,x1,y1,x2,y2:longint;
  g:array[1..2000,1..2000] of longint;

procedure add;
  begin
     readln(x,y,z);
     g[x,y]:=g[x,y]+z;
  end;
function qus:longint;
  begin
    ans:=0;
    readln(x1,y1,x2,y2);
    for k:=x1 to x2 do
      for j:=y1 to y2 do
         ans:=ans+g[k,j];
    writeln(ans);
  end;
begin
  assign(input,'locust.in');
  assign(output,'locust.out');
  reset(input);
  rewrite(output);
  readln(w);
  readln(n);
  for i:=1 to n do
    begin
      read(l);
      if l=1 then add
             else qus;
    end;
  close(input);
  close(output);
end.