#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; int q; ll d; set se; void solve(){ cin >> d >> q; ll ans=0; rep(i,q){ auto id=se.begin(); //rep(i,se.size()){ //cout << (*id).first << " " << (*id).second << " " << endl; //id++; //} ll a,b; cin >> a >> b;b++; auto idx=se.upper_bound(LP(a,INF)); if(se.empty()){ ans=max(ans,b-a); se.insert(LP(a,b)); cout << ans << endl; continue; } if(idx==se.begin()){ while((*idx).first<=b){ b=max(b,(*idx).second); idx=se.erase(idx); if(idx==se.end()) break; } ans=max(ans,b-a); se.insert(LP(a,b)); } else{ idx--; if((*idx).second