Problem:
Range Update Query (RUQ)

Write a program which manipulates a sequence A = {a0, a1, . . . , an−1} with the following operations:

update(s, t, x): change as, as+1, ..., at to x.

find(i): output the value of ai.

Note that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.

Input

n q
query1
query2
:
queryq

In the first line, n (the number of elements in A) and q (the number of queries) are given. Then, ith query queryi is given in the following format:

0 s t x

or

1 i

The first digit represents the type of the query. '0' denotes update(s, t, x) and '1' denotes find(i).

Output

For each find operation, print the value.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 100000

0 ≤ s ≤ t < n

0 ≤ i < n

0 ≤ x < 231−1

Sample Input 1

3 5
0 0 1 1
0 1 2 3
0 2 2 2
1 0
1 1

Sample Output 1

1
3

Sample Input 2

1 3
1 0
0 0 0 5
1 0

Sample Output 2

2147483647
5

Solution in Rust (judge verdict: Accepted)

#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { println ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }

struct SEG {
    buf: Vec<Option<u64>>,
    n: usize,
}

impl SEG {
    fn new(size: usize) -> SEG {
        let n = (1..).map(|i| 1 << i).find(|&x| x >= size).unwrap();

        let mut buf = vec![None; 2 * n];
        for x in &mut buf[n - 1..] {
            *x = Some((1 << 31) - 1);
        }

        SEG { buf: buf, n: n }
    }

    fn eval(&mut self, k: usize, l: usize, r: usize) {
        if r - l > 1 {
            if let Some(x) = self.buf[k].take() {
                self.buf[2 * k + 1] = Some(x);
                self.buf[2 * k + 2] = Some(x);
            }
        }
    }

    fn update(&mut self, x: u64, s: usize, t: usize, k: usize, l: usize, r: usize) {
        self.eval(k, l, r);
        if t <= l || s >= r {
            return;
        }

        if s <= l && r <= t {
            self.buf[k] = Some(x);
            self.eval(k, l, r);
            return;
        }

        self.update(x, s, t, 2 * k + 1, l, (l + r) / 2);
        self.update(x, s, t, 2 * k + 2, (l + r) / 2, r);
    }

    fn find(&mut self, i: usize, k: usize, l: usize, r: usize) -> Option<u64> {
        self.eval(k, l, r);
        if l == i && r == i + 1 {
            return self.buf[k];
        }

        if l > i || r <= i {
            return None;
        }

        let vl = self.find(i, 2 * k + 1, l, (l + r) / 2);
        let vr = self.find(i, 2 * k + 2, (l + r) / 2, r);

        vl.or(vr)
    }
}

fn main() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());
    let (n, q) = get!(usize, usize);

    let mut seg = SEG::new(n);
    let n = seg.n;
    for _ in 0..q {
        let v = util::gets::<usize>();
        if v[0] == 0 {
            seg.update(v[3] as u64, v[1], v[2] + 1, 0, 0, n);
        } else {
            writeln!(out, "{}", seg.find(v[1], 0, 0, n).unwrap()).unwrap();
        }
    }
}