Problem:
Score : 600 points

Problem Statement

There is a grid of squares with H+1 horizontal rows and W vertical columns.

You will start at one of the squares in the top row and repeat moving one square right or down. However, for each integer i from 1 through H, you cannot move down from the A_i-th, (A_i + 1)-th, \ldots, B_i-th squares from the left in the i-th row from the top.

For each integer k from 1 through H, find the minimum number of moves needed to reach one of the squares in the (k+1)-th row from the top. (The starting square can be chosen individually for each case.) If, starting from any square in the top row, none of the squares in the (k+1)-th row can be reached, print -1 instead.

Constraints

1 \leq H,W \leq 2\times 10^5

1 \leq A_i \leq B_i \leq W

Input

Input is given from Standard Input in the following format:

H W
A_1 B_1
A_2 B_2
:
A_H B_H

Output

Print H lines. The i-th line should contain the answer for the case k=i.

Sample Input 1

4 4
2 4
1 1
2 3
2 4

Sample Output 1

1
3
6
-1

Let (i,j) denote the square at the i-th row from the top and j-th column from the left.

For k=1, we need one move such as (1,1) → (2,1).

For k=2, we need three moves such as (1,1) → (2,1) → (2,2) → (3,2).

For k=3, we need six moves such as (1,1) → (2,1) → (2,2) → (3,2) → (3,3) → (3,4) → (4,4).

For k=4, it is impossible to reach any square in the fifth row from the top.

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using nint=System.Int32;
static class Program{
	const int mod=(int)1e9+7;
	const double eps=1e-11;
	static void Main(){
		Sc sc=new Sc();
		var s=sc.Ia;
		var avl=new Avl(true,true);
		var avl2=new Avl(false,false);
		for(int i = 1;i<=s[1];i++) {
			avl.Ud(i,i);
			avl2.Ud(i,0);
		}
		StringBuilder sb=new StringBuilder();
		for(int i = 1;i<=s[0];i++) {
			var e=sc.Ia;
			var d=avl.Gl(1,s[1],e[0]);
			int p=0,g=e[1]!=s[1]?e[1]+1:mod;
			while(d!=avl.du&&d.d<=e[1]){
				p=Max(p,d.n);
				avl.Dl(d.n);
				avl2.Dl(d.n);
				d=avl.Gl(1,s[1],e[0]);
			}
			if(p!=0&&g!=mod){
				avl.Ud(p,g);
				avl2.Ud(p,g-p);
			}
			sb.Append(Max(avl2.Rd(0,s[1]).d+i,-1)+"\n");
		}
		Console.Write(sb);
	}
}
public class Avl{
	public class Nd{
		public int h=1,c=1;
		public readonly nint n;
		public long d;
		public Nd l,r,nx;
		public Nd(nint n,long d,Nd du){this.n=n;this.d=d;nx=this;l=du;r=du;}
		public override string ToString()=>"n:"+n.ToString()+" d:"+d.ToString();
	}
	private Func<long,long,bool> compare;
	private Action<Nd> compare2;
	public Nd root,du;
	public int cnt=0;
	public bool bb;
	public Avl(bool bo,bool bb){
		if(bo){
			du=new Nd(nint.MinValue,long.MinValue,du);
			compare=CoMax;
			compare2=CoMax;
		}
		else{
			du=new Nd(nint.MinValue,long.MaxValue,du);
			compare=CoMin;
			compare2=CoMin;
		}
		this.bb=bb;
		du.h=0;du.c=0;
		root=du;
	}
	private bool CoMax(long a,long b){return a>=b;}
	private bool CoMin(long a,long b){return a<=b;}
	private void CoMax(Nd t){
		t.nx=t;
		if(t.nx.d<t.l.nx.d){t.nx=t.l.nx;}
		if(t.nx.d<t.r.nx.d){t.nx=t.r.nx;}
	}
	private void CoMin(Nd t){
		t.nx=t;
		if(t.nx.d>t.l.nx.d){t.nx=t.l.nx;}
		if(t.nx.d>t.r.nx.d){t.nx=t.r.nx;}
	}
	public void Ud(nint n,long d){
		if(root==du){root=new Nd(n,d,du);cnt++;}
		else if(root.n==n){
			if(bb){root.d+=d;}
			else{root.d=d;}
			compare2(root);
		}
		else if(Fu(root,n,d)){
			if(Abs(root.l.h-root.r.h)>1){root=Rotate(root);}
			cnt++;
		}
	}
	private bool Fu(Nd t,nint n,long d){
		bool bo=false;
		if(t.n>n){
			if(t.l!=du){
				if(t.l.n==n){
					if(bb){t.l.d+=d;}
					else{t.l.d=d;}
					compare2(t.l);
				}
				else if(bo=Fu(t.l,n,d)){
					t.c++;
					if(Abs(t.l.l.h-t.l.r.h)>1){t.l=Rotate(t.l);}
					t.h=Max(t.l.h,t.r.h)+1;
				}
				compare2(t);
			}
			else{
				t.l=new Nd(n,d,du);
				bo=true;
				t.c++;
				t.h=Max(t.l.h,t.r.h)+1;
				t.nx=compare(t.nx.d,t.l.d)?t.nx:t.l;
			}
		}
		else{
			if(t.r!=du){
				if(t.r.n==n){
					if(bb){t.r.d+=d;}
					else{t.r.d=d;}
					compare2(t.r);
				}
				else if(bo=Fu(t.r,n,d)){
					t.c++;
					if(Abs(t.r.l.h-t.r.r.h)>1){t.r=Rotate(t.r);}
					t.h=Max(t.l.h,t.r.h)+1;
				}
				compare2(t);
			}
			else{
				t.r=new Nd(n,d,du);
				bo=true;
				t.c++;
				t.h=Max(t.l.h,t.r.h)+1;
				t.nx=compare(t.nx.d,t.r.d)?t.nx:t.r;
			}
		}
		return bo;
	}
	private Nd Rotate(Nd t){
		Nd nd=du;
		if(t.l.h>t.r.h){
			if(t.l.l.h>t.l.r.h){
				nd=t.l;t.l=t.l.r;nd.r=t;
				Ft(t);
			}
			else{
				nd=t.l.r;
				t.l.r=nd.l;nd.l=t.l;
				Ft(t.l);
				t.l=nd.r;nd.r=t;
				Ft(t);
			}
		}
		else{
			if(t.r.l.h>t.r.r.h){
				nd=t.r.l;
				t.r.l=nd.r;nd.r=t.r;
				Ft(t.r);
				t.r=nd.l;nd.l=t;
				Ft(t);
			}
			else{
				nd=t.r;t.r=t.r.l;nd.l=t;
				Ft(t);
			}
		}
		Ft(nd);
		return nd;
	}
	private void Ft(Nd t){
		t.h=Max(t.l.h,t.r.h)+1;
		t.c=t.l.c+t.r.c+1;
		compare2(t);
	}
	public bool Dl(nint n){
		if(cnt==0){return false;}
		Nd t=root;
		if(t.n==n){
			root=Fd2(root);
			if(cnt==0){return true;}
			else if(Abs(root.l.h-root.r.h)>1){root=Rotate(root);}
			else{Ft(root);}
			return true;
		}
		bool bo=Fd1(root,n);
		if(Abs(root.l.h-root.r.h)>1){root=Rotate(root);}
		else{Ft(root);}
		return bo;
	}
	private bool Fd1(Nd t,nint n){
		if(t.n>n){
			if(t.l==du){return false;}
			else if(t.l.n!=n){
				bool bo=Fd1(t.l,n);
				if(Abs(t.l.l.h-t.l.r.h)>1){t.l=Rotate(t.l);}
				else{Ft(t.l);}
				return bo;
			}
			else{
				t.l=Fd2(t.l);
				Ft(t);
				return true;
			}
		}
		else{
			if(t.r==du){return false;}
			else if(t.r.n!=n){
				bool bo=Fd1(t.r,n);
				if(Abs(t.r.l.h-t.r.r.h)>1){t.r=Rotate(t.r);}
				else{Ft(t.r);}
				return bo;
			}
			else{
				t.r=Fd2(t.r);
				Ft(t);
				return true;
			}
		}
	}
	private Nd Fd2(Nd dn){
		cnt--;
		if(dn.l==du){return dn.r;}
		if(dn.r==du){return dn.l;}
		Nd u=dn.l;
		if(u.r==du){
			u.r=dn.r;
			Ft(u);
			return u;
		}
		u=Fd3(u,dn);
		if(Abs(dn.l.l.h-dn.l.r.h)>1){u.l=Rotate(dn.l);}
		else{Ft(dn.l);}
		Ft(u);
		return u;
	}
	private Nd Fd3(Nd u,Nd dn){
		if(u.r.r!=du){
			Nd v=Fd3(u.r,dn);
			if(Abs(u.r.l.h-u.r.r.h)>1){u.r=Rotate(u.r);}
			else{Ft(u.r);}
			return v;
		}
		else{
			Nd v=u.r;u.r=u.r.l;v.l=dn.l;v.r=dn.r;
			return v;
		}
	}
	public Nd Hs(nint n){
		Nd t=root;
		if(cnt==0){return du;}
		if(t.n==n){return t;}
		Nd a=du;
		while(true){
			if(t.n>n){
				if(t.l==du){break;}
				else if(t.l.n!=n){t=t.l;}
				else{a=t.l;break;}
			}
			else{
				if(t.r==du){break;}
				else if(t.r.n!=n){t=t.r;}
				else{a=t.r;break;}
			}
		}
		return a;
	}
	public Nd Ra(int n){return cnt>=n&&cnt!=0?Fr(root,n):du;}
	private Nd Fr(Nd t,int n){
		if(t.l.c>n-1){return Fr(t.l,n);}
		if(t.l.c<n-1){return Fr(t.r,n-t.l.c-1);}
		return t;
	}
	public Nd Lb(nint n){return cnt!=0?Flb(root,n):du;}
	private Nd Flb(Nd t,nint n){
		if(t.n<n){
			if(t.r==du){return du;}
			return Flb(t.r,n);
		}
		if(t.n>n){
			if(t.l==du){return t;}
			Nd u=Flb(t.l,n);
			return u==du?t:u;
		}
		return t;
	}
	public Nd Ub(nint n){return cnt!=0?Fub(root,n):du;}
	private Nd Fub(Nd t,nint n){
		if(t.n>n){
			if(t.l==du){return du;}
			return Fub(t.l,n);
		}
		if(t.n<n){
			if(t.r==du){return t;}
			Nd u=Fub(t.r,n);
			return u==du?t:u;
		}
		return t;
	}
	public int Rg(nint a,nint b){return cnt!=0?Frg(root,a,b,false,false):0;}
	private int Frg(Nd t,nint a,nint b,bool l,bool r){
		if(t.h==0){return 0;}
		if(l&&r){return t.c;}
		if(t.n<a){return Frg(t.r,a,b,t.n>=a,r);}
		if(t.n>b){return Frg(t.l,a,b,l,t.n<=b);}
		return Frg(t.l,a,b,l,t.n<=b)+Frg(t.r,a,b,t.n>=a,r)+1;
	}
	public Nd Rd(nint a,nint b){return cnt!=0?Frd(root,a,b,false,false):du;}
	private Nd Frd(Nd t,nint a,nint b,bool l,bool r){
		if(t.h==0){return du;}
		if(l&&r){return t.nx;}
		if(t.n<a){return Frd(t.r,a,b,t.n>=a,r);}
		if(t.n>b){return Frd(t.l,a,b,l,t.n<=b);}
		var e1=Frd(t.l,a,b,l,t.n<=b);
		var e2=Frd(t.r,a,b,t.n>=a,r);
		e1=compare(e1.d,e2.d)?e1:e2;
		return compare(t.d,e1.d)?t:e1;
	}
	public Nd Gl(nint a,nint b,long d){return cnt==0?du:Fgl(root,a,b,d);}
	private Nd Fgl(Nd t,nint a,nint b,long d){
		Nd p=du;
		if(a<=t.n&&t.n<=b&&compare(t.d,d)){p=t;}
		if(a<=t.n&&compare(t.l.nx.d,d)){
			var z=Fgl(t.l,a,b,d);
			if(z!=du){p=z;}
		}
		if(p==du&&t.n<=b&&compare(t.r.nx.d,d)){p=Fgl(t.r,a,b,d);}
		return p;
	}
	public Nd Gr(nint a,nint b,long d){return cnt==0?du:Fgr(root,a,b,d);}
	private Nd Fgr(Nd t,nint a,nint b,long d){
		Nd p=du;
		if(a<=t.n&&t.n<=b&&compare(t.d,d)){p=t;}
		if(t.n<=b&&compare(t.r.nx.d,d)){
			var z=Fgr(t.r,a,b,d);
			if(z!=du){p=z;}
		}
		if(p==du&&a<=t.n&&compare(t.l.nx.d,d)){p=Fgr(t.l,a,b,d);}
		return p;
	}
	public void En(Action<Nd> f){if(cnt>0){Fen(root,f);}}
	private void Fen(Nd t,Action<Nd> f){
		f(t);
		if(t.l!=du){Fen(t.l,f);}
		if(t.r!=du){Fen(t.r,f);}
	}
}
public class Sc{
	public int I{get{return int.Parse(Console.ReadLine());}}
	public long L{get{return long.Parse(Console.ReadLine());}}
	public double D{get{return double.Parse(Console.ReadLine());}}
	public string S{get{return Console.ReadLine();}}
	public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
	public string[] Sa{get{return Console.ReadLine().Split();}}
	public object[] Oa{get{return Console.ReadLine().Split();}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),double.Parse);}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}