use std::collections::BTreeMap;

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! min {
    ($a:expr $(,)*) => {{
        $a
    }};
    ($a:expr, $b:expr, $(,)*) => {{
        std::cmp::min($a, $b)
    }};
    ($a:expr, $($rest:expr),+ $(,)*) => {{
        std::cmp::min($a, min!($($rest),+))
    }};
}

#[allow(unused_macros)]
// Choice the minimum element and update the first argument
macro_rules! chmin {
    ($base:expr, $($cmps:expr),+ $(,)*) => {{
        let cmp_min = min!($($cmps),+);
        if $base > cmp_min {
            $base = cmp_min;
            true
        } else {
            false
        }
    }};
}

fn main() {
    input! {
        n: usize,
        q: usize,
        stx: [(i32, i32, i32); n],
        d_: [i32; q],
    }

    let mut cs = vec![];
    for i in 0..n {
        // (S[i] - X[i], X[i], true)
        cs.push((stx[i].0 - stx[i].2, stx[i].2, true));
        // (T[i] - X[i], X[i], false)
        cs.push((stx[i].1 - stx[i].2, stx[i].2, false));
    }
    cs.push((0, std::i32::MAX, true));
    cs.push((std::i32::MAX, std::i32::MAX, false));
    cs.sort_by_key(|&e| e.0); // O(n log n)
    cs.reverse();

    // dbg!(&cs);

    let mut d = vec![];
    for i in 0..q {
        d.push((i, d_[i].clone()));
    }
    d.sort_by_key(|e| e.1); // O(q log q)

    let mut mset = BTreeMap::new();
    let mut ret = vec![0; q];
    for (i, di) in d.iter() {
        while cs.last().unwrap().0 <= *di {
            let (_, pos, event) = cs.pop().unwrap();
            if event {
                // in
                let entry = mset.entry(pos).or_insert(0);
                *entry += 1;
            } else {
                // out
                let entry = mset.entry(pos).or_default();
                if *entry == 1 {
                    mset.remove(&pos);
                } else {
                    *entry -= 1;
                }
            }
        }
        ret[*i] = *mset.iter().nth(0).unwrap().0;
    }

    for i in 0..q {
        if ret[i] < std::i32::MAX {
            println!("{}", ret[i]);
        } else {
            println!("-1");
        }
    }
}


Measured memory_bytes: 16732