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 Rust (1.42.0) (judge verdict: Wrong Answer)

use std::collections::BTreeSet;
use std::io::{BufRead, Write};

fn main () {
    let stdin = std::io::stdin();
    let stdout = std::io::stdout();
    let mut reader = std::io::BufReader::new(stdin.lock());
    let mut writer = std::io::BufWriter::new(stdout.lock());

    let (h, w): (usize, usize) = {
        let mut buf = String::new();
        reader.read_line(&mut buf).unwrap();
        let mut iter = buf.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    };

    let mut set1: BTreeSet<(usize, usize)> = (0..w).map(|i| (i, 0)).collect();
    let mut set2: BTreeSet<(usize, usize)> = (0..w).map(|i| (0, i)).collect();
    for i in 0..h {
        let (a, b): (usize, usize) = {
            let mut buf = String::new();
            reader.read_line(&mut buf).unwrap();
            let mut iter = buf.split_whitespace();
            (
                iter.next().unwrap().parse::<usize>().unwrap() - 1,
                iter.next().unwrap().parse::<usize>().unwrap() - 1,
            )
        };

        let mut tmp = Vec::new();
        let mut p = (!0, 0);
        for &(i, val) in set1.range((a, 0)..).clone() {
            if i <= b {
                p = (i, val);
                tmp.push(p);
            } else {
                break;
            }
        }
        for q in tmp {
            set1.remove(&q);
            set2.remove(&(q.1, q.0));
        }
        if p != (!0, 0) && b + 1 < w {
            if !set1.contains(&(b + 1, p.1 + b + 1 - p.0)) {
                set1.insert((b + 1, p.1 + b + 1 - p.0));
                set2.insert((p.1 + b + 1 - p.0, b + 1));        
            }
        }
        match set2.iter().rev().next() {
            Some(q) => writeln!(writer, "{}", q.0 + i + 1).unwrap(),
            None => writeln!(writer, "-1").unwrap(),
        }
    }
}