var c:array[1..100000] of longint;
    i,n,m,x,a,b,d:longint;
procedure adaug(a,b:longint);
    var k,p:longint;
    begin
      if a<=n then
         begin
           c[a]:=c[a]+b;
           p:=a and (not (a-1));
           adaug(a+p,b);
         end;
    end;
function calc(x:longint):longint;
     var p,k:longint;
     begin
       if x<>0 then
         begin
           p:=x and (not(x-1));
           calc:=c[x]+calc(x-p);
         end else calc:=0;
    end;
{function min(st,dr,b:longint):longint;
    var p,k:longint;
    begin
      if st>dr then min:=-1
          else
            begin
              p:=(st+dr) div 2;
              k:=calc(p);
              if k>b then min:=min(1,p-1,b);
              if k<b then min:=min(p+1,n,b);
              if k=b then min:=p;
            end;
    end;    }

begin
assign(input,'aib.in'); reset(input);
assign(output,'aib.out'); rewrite(output);
readln(n,m);
for i:=1 to n do  begin  read(x); adaug(i,x); end;

for i:=1 to m do
  begin
    read(a);
    if a=0 then
        begin
          read(b,d);
          adaug(b,d);
        end
            else if a=1 then
              begin
                read(b,d);
                writeln(calc(d)-calc(b-1));
              end
                      else
                    begin
                      read(b);
                     { d:=min(1,n,b);
                      writeln(d);}
                      d:=1;
                      while (calc(d)<>b)and(d<n) do inc(d);
                      if calc(d)<>b then writeln('-1') else writeln(d);
                    end;
  end;
close(input);
close(output);
end.