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: Accepted)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
#[allow(unused_imports)]
use itertools::Itertools;
use proconio::input;
#[allow(unused_imports)]
use proconio::marker::*;

fn main() {
    input! {
        h: usize,
        w: usize,
        ab: [(Usize1, usize); h],
    }
    // use std::cmp::{max, min};
    // let mut st = kyopro_lib::segtree::LazySegTree::build_from_iter(
    //     (0..w).map(|i| (0, Some(i))),
    //     (w, None),
    //     |&a, &b| (min(a.0, b.0), max(a.1, b.1)),
    //     |_, &b| b,
    //     |_, &b, _| b,
    // );

    // for (i, &(a, b)) in ab.iter().enumerate() {
    //     if b < w {
    //         if let Some(x) = st.query(a..=b).1 {
    //             st.update_range(b..=b, (b - x, Some(x)));
    //         }
    //     }

    //     let x = st.query(..a).1;
    //     st.update_range(a..b, (w, x));

    //     let x = st.query(..w);
    //     if x.0 == w {
    //         println!("-1");
    //     } else {
    //         println!("{}", i + 1 + x.0);
    //     }
    // }

    let mut st = kyopro_lib::segtree::LazySegTree::build_from_iter(
        (0..w).map(|i| (i, 0)),
        (0, w),
        |a, b| (a.0, std::cmp::min(a.1, b.1)),
        |_: &(usize, usize), &b| b,
        |a, b, _| (a.0, b.0 + a.0 - b.1),
    );

    for (i, &(a, b)) in ab.iter().enumerate() {
        if a != 0 {
            let x = st.query(a - 1..a).1;
            st.update_range(a..b, (x, a - 1));
        } else {
            st.update_range(a..b, (w, 0));
        }

        let x = st.query(..w).1;
        if x < w {
            println!("{}", i + 1 + x);
        } else {
            println!("-1");
        }
    }
}
*/

fn main() {
    let exe = "/tmp/bin72129975";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";