#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

//Seat Pressure O(NlogN)
template<class T> vector<int> Zarts(const vector<T> & ar, int cnt = 0) {
    vector<int> res;
    map<T, int> mp;
    for (auto &e : ar) mp[e] = 0;
    for (auto &e : mp) e.second = cnt++;
    for (auto &e : ar) res.push_back(mp[e]);
    return res;
}


template<class T> class Lazy_Segment_Tree_Range_Minimum_Query {
	size_t N, M;
	T ini;
	vector<T> node, lazy;
	vector<bool> lazyflag;

public:
	Lazy_Segment_Tree_Range_Minimum_Query(const vector<T>& ar, const T ini) : M(ar.size()), ini(ini) {
		for (N = 1; N < M; N *= 2);
		node.resize(2 * N - 1);
		lazy.resize(2 * N - 1, ini);
		lazyflag.resize(2 * N - 1, false);
		for (int i = 0; i<M; ++i) node[i + N - 1] = ar[i];
		for (int i = N - 2; i >= 0; --i) node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
	}

	Lazy_Segment_Tree_Range_Minimum_Query(const size_t M, const T ini) : M(M), ini(ini) {
		for (N = 1; N < M; N *= 2);
		node.resize(2 * N - 1, ini);
		lazy.resize(2 * N - 1, ini);
		lazyflag.resize(2 * N - 1, false);
	}

	void eval(int k, int l, int r) {
		if (lazyflag[k]) {
			node[k] = lazy[k];
			if (r - l > 1) {
				lazy[k * 2 + 1] = lazy[k];
				lazy[k * 2 + 2] = lazy[k];
				lazyflag[k * 2 + 1] = lazyflag[k * 2 + 2] = true;
			}
			lazyflag[k] = false;
		}
	}

	void update(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = N;
		eval(k, l, r);
		if (b <= l || r <= a) return;
		if (a <= l && r <= b) {
			lazy[k] = x;
			lazyflag[k] = true;
			eval(k, l, r);
		}
		else {
			update(a, b, x, 2 * k + 1, l, (l + r) / 2);
			update(a, b, x, 2 * k + 2, (l + r) / 2, r);
			node[k] = min(node[2 * k + 1], node[2 * k + 2]);
		}
	}

	T getvar(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = N;
		eval(k, l, r);
		if (b <= l || r <= a) return ini;
		if (a <= l && r <= b) return node[k];
		T vl = getvar(a, b, 2 * k + 1, l, (l + r) / 2);
		T vr = getvar(a, b, 2 * k + 2, (l + r) / 2, r);
		return min(vl, vr);
	}

	T operator[](size_t idx) {
		return getvar(idx, idx + 1);
	}

	T operator[](pair<size_t, size_t> p) {
		return getvar(p.first, p.second);
	}

	void print() {
		cout << "{ " << getvar(0, 1);
		for (int i = 1; i < M; ++i) cout << ", " << getvar(i, i + 1);
		cout << " }" << endl;
	}
};


template<class T> class Lazy_Segment_Tree_Range_Maximum_Query {
	size_t N, M;
	T ini;
	vector<T> node, lazy;
	vector<bool> lazyflag;

public:
	Lazy_Segment_Tree_Range_Maximum_Query(const vector<T>& ar, const T ini) : M(ar.size()), ini(ini) {
		for (N = 1; N < M; N *= 2);
		node.resize(2 * N - 1);
		lazy.resize(2 * N - 1, ini);
		lazyflag.resize(2 * N - 1, false);
		for (int i = 0; i<M; ++i) node[i + N - 1] = ar[i];
		for (int i = N - 2; i >= 0; --i) node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
	}

	Lazy_Segment_Tree_Range_Maximum_Query(const size_t M, const T ini) : M(M), ini(ini) {
		for (N = 1; N < M; N *= 2);
		node.resize(2 * N - 1, ini);
		lazy.resize(2 * N - 1, ini);
		lazyflag.resize(2 * N - 1, false);
	}

	void eval(int k, int l, int r) {
		if (lazyflag[k]) {
			node[k] = lazy[k];
			if (r - l > 1) {
				lazy[k * 2 + 1] = lazy[k];
				lazy[k * 2 + 2] = lazy[k];
				lazyflag[k * 2 + 1] = lazyflag[k * 2 + 2] = true;
			}
			lazyflag[k] = false;
		}
	}

	void update(int a, int b, T x, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = N;
		eval(k, l, r);
		if (b <= l || r <= a) return;
		if (a <= l && r <= b) {
			lazy[k] = x;
			lazyflag[k] = true;
			eval(k, l, r);
		}
		else {
			update(a, b, x, 2 * k + 1, l, (l + r) / 2);
			update(a, b, x, 2 * k + 2, (l + r) / 2, r);
			node[k] = max(node[2 * k + 1], node[2 * k + 2]);
		}
	}

	T getvar(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = N;
		eval(k, l, r);
		if (b <= l || r <= a) return ini;
		if (a <= l && r <= b) return node[k];
		T vl = getvar(a, b, 2 * k + 1, l, (l + r) / 2);
		T vr = getvar(a, b, 2 * k + 2, (l + r) / 2, r);
		return max(vl, vr);
	}

	T operator[](size_t idx) {
		return getvar(idx, idx + 1);
	}

	T operator[](pair<size_t, size_t> p) {
		return getvar(p.first, p.second);
	}

	void print() {
		cout << "{ " << getvar(0, 1);
		for (int i = 1; i < M; ++i) cout << ", " << getvar(i, i + 1);
		cout << " }" << endl;
	}
};

int main() {
	ll N,Q; cin >> N >> Q;
	V<ll> S(N),T(N),X(N);
	for(int i = 0; i < N; ++i) cin >> S[i] >> T[i] >> X[i];
	
	V<ll> D(Q);
	for(int i = 0; i < Q; ++i) cin >> D[i];
	
	for(int i = 0; i < N; ++i) {
		S[i] -= X[i];
		T[i] -= X[i];
	}
	
	V<ll> a(2*N+Q);
	for(int i = 0; i < N; ++i){
		a[i] = S[i];
	}
	for(int i = 0; i < N; ++i){
		a[i+N] = T[i];
	}
	for(int i = 0; i < Q; ++i){
		a[i+2*N] = D[i];
	}
	
	auto b = Zarts<ll>(a);
	Lazy_Segment_Tree_Range_Minimum_Query<ll> Seg(2*N+Q+10,HIGHINF);
	V<P<ll,int>> ord(N);

	for(int i = 0; i < N; ++i) ord[i] = {X[i],i};
	sort(ALL(ord),greater<P<ll,int>>());

	for(int j = 0; j < N; ++j){

		int i = ord[j].second;
		int l = b[i];
		int r = b[i+N];
		Seg.update(l,r,X[i]);
	}
	for(int i = 0; i < Q; ++i){
		ll cost = Seg.getvar(b[i+2*N],b[i+2*N]+1);
		if(cost==HIGHINF) cost = -1;
		cout << cost << endl;
	}
	
    return 0;
}


Measured memory_bytes: 56816