#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))

// Monoid: オブジェクト
// OperatorMonoid: オブジェクトに作用する変数
// f,g,hがどこで使用されているかを見るとやりやすい
template<typename Monoid, typename OperatorMonoid = Monoid>
class LazySegmentTree {
private:
	using F = function<Monoid(Monoid, Monoid)>;
	using G = function<Monoid(Monoid, OperatorMonoid, int)>;
	using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;

	int sz; // 対応する配列の幅
	vector<Monoid> data;
	vector<OperatorMonoid> lazy;
	const F f; // 2区間マージ演算(data-dataマージ)
	const G g; // 要素,作用素マージ演算(lazy->data伝搬時の、(data,lazy,len)の計算)
	const H h; // 作用素マージ演算　(query->lazy伝搬時の、(lazy,query_value)の計算)
	const Monoid M1;          // モノイド単位元　(data単位元)
	const OperatorMonoid OM0; // 作用素単位元 (lazy単位元)

	void propagate(int idx, int len) {
		// 幅lenのlazy[idx]が存在するとき、値を下に流す
		if (lazy[idx] != OM0) {
			if (idx < sz) {
				lazy[(idx << 1) | 0] = h(lazy[(idx << 1) | 0], lazy[idx]);
				lazy[(idx << 1) | 1] = h(lazy[(idx << 1) | 1], lazy[idx]);
			}
			data[idx] = g(data[idx], lazy[idx], len);
			lazy[idx] = OM0;
		}
	}
	Monoid update_impl(int a, int b, const OperatorMonoid& val, int idx, int l, int r) {
		propagate(idx, r - l);
		if (r <= a || b <= l)return data[idx];
		else if (a <= l && r <= b) {
			lazy[idx] = h(lazy[idx], val);
			propagate(idx, r - l);
			return data[idx];
		}
		else return data[idx] = f(
			update_impl(a, b, val, (idx << 1) | 0, l, (l + r) >> 1),
			update_impl(a, b, val, (idx << 1) | 1, (l + r) >> 1, r)
		);
	}
	Monoid query_impl(int a, int b, int idx, int l, int r) {
		propagate(idx, r - l);
		if (r <= a || b <= l)return M1;
		else if (a <= l && r <= b)return data[idx];
		else return f(
			query_impl(a, b, (idx << 1) | 0, l, (l + r) >> 1),
			query_impl(a, b, (idx << 1) | 1, (l + r) >> 1, r)
		);
	}

public:
	// init忘れに注意
	LazySegmentTree(int n, const F f, const G g, const H h,
		const Monoid& M1, const OperatorMonoid OM0)
		:f(f), g(g), h(h), M1(M1), OM0(OM0) {
		sz = 1;
		while (sz < n)sz <<= 1;
		data.assign(2 * sz, M1);
		lazy.assign(2 * sz, OM0);
	}
	void build(const vector<Monoid>& vals) {
		rep(idx, vals.size())data[idx + sz] = vals[idx];
		for (int idx = sz - 1; idx > 0; idx--) {
			data[idx] = f(data[(idx << 1) | 0], data[(idx << 1) | 1]);
		}
	}
	Monoid update(int a, int b, const OperatorMonoid& val) {
		return update_impl(a, b, val, 1, 0, sz);
	}
	Monoid query(int a, int b) {
		return query_impl(a, b, 1, 0, sz);
	}
	Monoid operator[](const int& idx) {
		return query(idx, idx + 1);
	}
};

int main()
{
	int N, Q;
	cin >> N >> Q;

	constexpr int MONOID_E = 1500000000;
	vector<vector<int>> stx(N, vector<int>(3));
	vector<int> D(Q);
	set<int> st;
	map<int, int> mp;
	rep(i, N)rep(j, 3)cin >> stx[i][j];
	rep(q, Q) {
		cin >> D[q];
		st.insert(D[q]);
		mp[D[q]] = q;
	}
	auto f = [](int a, int b) {return min(a, b); };
	auto g = [](int a, int b, int sz) {return min(a, b); };
	LazySegmentTree<int> lst(Q, f, g, f, MONOID_E, MONOID_E);

	for (auto query : stx) {
		int s = query[0];
		int t = query[1];
		int x = query[2];
		if (x == 4185) {
			cerr << "now" << endl;
		}
		s -= x;
		t -= x;

		auto itrs = st.lower_bound(s);
		if (itrs == st.end())continue;
		s = mp[*itrs];

		auto itrt = st.lower_bound(t);
		t = itrt == st.end() ? Q : mp[*itrt];
		lst.update(s, t, x);
	}
	rep(i, Q) {
		int ans = lst.query(i, i + 1);
		cout << (ans == MONOID_E ? -1 : ans) << endl;
	}
	return 0;
}


Measured memory_bytes: 36864