typearr=recordall,mark:longint;end;
constmaxn=10000000;
vartree:array[0..maxn]of arr;size,lson,rson,root1,root2:array[0..maxn]of longint;tot,sum,n,m,i,j,k,l:longint;function add:longint;
begininc(tot);exit(tot);
end;procedure sinsert(var x:longint;y,z:longint);
varleft,right,mid,old:longint;
beginif x=0 then x:=add;old:=x;left:=1;right:=n;while left<=right do beginmid:=(left+right)>>1;inc(size[x],z);if left=right then break;if y<=mid then beginright:=mid;if lson[x]=0 then lson[x]:=add;x:=lson[x];endelse beginleft:=mid+1;if rson[x]=0 then rson[x]:=add;x:=rson[x];end;end;x:=old;
end;procedure binsert(x,l,r,tl,tr,tc:longint);
varmid:longint;
beginif (tl=l) and (tr=r) then beginsinsert(tree[x].mark,tc,1);exit;end;mid:=(l+r)>>1;sinsert(tree[x].all,tc,tr-tl+1);if tl>mid then binsert(x<<1+1,mid+1,r,tl,tr,tc)elseif tr<=mid then binsert(x<<1,l,mid,tl,tr,tc)else beginbinsert(x<<1,l,mid,tl,mid,tc);binsert(x<<1+1,mid+1,r,mid+1,tr,tc);end;
end;procedure before(x,l,r,tl,tr:longint);
varmid:longint;
begininc(sum);root1[sum]:=tree[x].mark;root2[sum]:=tr-tl+1;if (tl=l) and (tr=r) then begininc(sum);root1[sum]:=tree[x].all;root2[sum]:=1;exit;end;mid:=(l+r)>>1;if tl>mid then before(x<<1+1,mid+1,r,tl,tr)elseif tr<=mid then before(x<<1,l,mid,tl,tr)else beginbefore(x<<1,l,mid,tl,mid);before(x<<1+1,mid+1,r,mid+1,tr);end;
end;procedure query(x,y,z:longint);
varleft,right,now,mid:longint;
beginsum:=0;before(1,1,n,x,y);left:=1;right:=n;while left<right do beginnow:=0;mid:=(left+right)>>1;for i:=1 to sum donow:=size[rson[root1[i]]]*root2[i]+now;if now<z then begindec(z,now);right:=mid;for i:=1 to sum doroot1[i]:=lson[root1[i]];endelse beginleft:=mid+1;for i:=1 to sum doroot1[i]:=rson[root1[i]];end;end;writeln(left);
end;beginreadln(n,m);while m>0 do begindec(m);readln(i,j,k,l);if i=1 then binsert(1,1,n,j,k,l)else query(j,k,l);end;readln;readln;
end.