珂朵莉树T了一个点，身败名裂

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<set>
#define re register
#define FOR(i,l,r) for(re int i=l;i<=r;++i)
#define IT set<node>::iterator 
using namespace std;

int n,m,c,r,t,x,y,z,sq;

inline char nc(){ 
    static char buf[100000],*p1=buf,*p2=buf; 
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++; 
}
inline int read(){
    re char ch=nc();
    re int sum=0; 
    while(!(ch>='0'&&ch<='9'))ch=nc(); 
    while(ch>='0'&&ch<='9')sum=sum*10+ch-48,ch=nc(); 
    return sum; 
} 

inline void out(re int a){
    if(a>=10)out(a/10);
    putchar(a%10+'0');
}

struct node{
	int l,r;
	mutable int v;
	node(int L,int R=-1,int V=0):l(L),r(R),v(V){}
	bool operator <(const node &o)const{
		return l<o.l;
	}
};
set<node> s;

inline IT split(int pos){
	IT it=s.lower_bound(node(pos));
	if(it!=s.end()&&it->l==pos)
	  return it;
	--it;
	int L=it->l;
	int R=it->r;
	int V=it->v;
	s.erase(it);
	s.insert(node(L,pos-1,V));
	return s.insert(node(pos,R,V)).first;
}

inline void assign_val(re int l,re int r,re int k){
	IT itr=split(r+1),itl=split(l);
	s.erase(itl,itr);
	s.insert(node(l,r,k));
}

inline int query(re int l,re int r){
	int res=0,anss=0;
	IT itr=split(r+1),itl=split(l),it;
	for(;itl!=itr;++itl){
		if(!itl->v){
			if(!res){
				res=itl->l;
			}
			anss+=itl->r-itl->l+1;
			if(anss>=sq){
				int cc=itl->r-(anss-sq);
				assign_val(res,cc,1);
			    return res;
			}
		}
		else{
			anss=0;
			res=0;
		}
	}
	return 0;
}

int main(){
	int ansss=0;
	n=read(),m=read();
	s.insert(node(1,n,0));
	FOR(i,1,m){
		t=read();
		if(t==1){
			sq=read();
			out(query(1,n));
			puts("");
			ansss++;
		}
		else{
			x=read(),y=read();
			assign_val(x,x+y-1,0);
		}
	}
}