#![allow(unused_imports)]
#![allow(dead_code)]
#![allow(non_camel_case_types)]
#![allow(non_snake_case)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;
use std::io::{Write, BufWriter};

// static MOD: usize = 998244353;
static MOD: usize = 1000000007;

// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($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)*}
    };
}

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)*}
    };
}

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:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

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

macro_rules! println_stderr(
    ($($arg:tt)*) => { {
        let r = writeln!(&mut ::std::io::stderr(), $($arg)*);
        r.expect("failed printing to stderr");
    } }
);

#[derive(Copy, Clone, Eq, PartialEq)]
struct Anon {
    x: i64,
    idx: usize,
}

// 順番を定義
impl Ord for Anon{
    fn cmp(&self, other: &Anon) -> Ordering {
        other.x.cmp(&self.x)
    }
}

impl PartialOrd for Anon {
    fn partial_cmp(&self, other: &Anon) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

#[derive(Eq, PartialEq, Clone, Debug)]
pub struct Rev<T>(pub T);

impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}

impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

fn solve() {
    input! {
        n: usize,
        q: usize,
        stx: [(i64,i64,i64);n],
        d: [i64;q],
    }  
    let mut set: BinaryHeap<Rev<i64>> = BinaryHeap::new();
    let mut map: HashMap<i64, Vec<(usize,usize)>> = HashMap::new();
    for (i, &(s,t,x)) in stx.iter().enumerate() {
        set.push(Rev(s-x));
        set.push(Rev(t-x));
        let mut a = vec![(i,n)];
        let mut b = vec![(n,i)];
        if let Some(t) = map.get_mut(&(s-x)) {
            t.push((i,n));
            a = t.to_vec();
        }
        if let Some(t) = map.get_mut(&(t-x)) {
            t.push((n,i));
            b = t.to_vec();
        }
        map.insert(s-x, a);
        map.insert(t-x, b);
    }
    let mut q : BinaryHeap<Anon> = BinaryHeap::new();
    let mut seen = vec![false;n];
    for x in d {
        while let Some(y) = set.pop(){
            if y.0 > x {
                set.push(Rev(y.0));
                break;
            }
            let  v = map.get(&y.0).unwrap();
            for i in 0..v.len(){
                let (a,b) = v[i];
                if a!=n {
                    q.push(Anon{x:stx[a].2, idx:a});
                }
                if b!=n {
                    seen[b] = true;
                }
            }  
        }
        while let Some(&y) = q.peek(){
            if seen[y.idx] {
                q.pop();
            }
            else{
                break;
            }
        }
        match q.peek() {
            None => println!("{}", -1),
            Some(r) => println!("{}", r.x),
        }
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}


Measured memory_bytes: 55620