#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

constexpr int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
constexpr int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template <class T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }


#include "bits/stdc++.h"

struct RU {
	using t1 = int;
	using t2 = int;
	static t1 id1() { return INT_MAX; }
	static t2 id2() { return -1; }
	static t1 op1(const t1& l, const t1& r) { return min(l, r); }
	static t1 op2(const t1& l, const t2& r) { return r == id2() ? l : r; }
	static t2 op3(const t2& l, const t2& r) { return r == id2() ? l : r; }
};
struct RARS {
	struct t1 {
		long long val, size;
		constexpr t1(long long v, long long s) :val(v), size(s) {}
	};
	using t2 = long long;
	static constexpr t1 id1() {
		return t1(0, 0);
	}
	static constexpr t2 id2() {
		return 0ll;
	}
	static t1 op1(const t1& a, const t1& b) {
		return t1(a.val + b.val, a.size + b.size);
	}
	static t1 op2(const t1& a, const t2& b) {
		return t1(a.val + b * a.size, a.size);
	}
	static t2 op3(const t2& a, const t2& b) {
		return a + b;
	}
};

struct RARm {
	using t1 = long long;
	using t2 = long long;
	static constexpr t1 id1() {
		return std::numeric_limits<t1> ::max() / 2;
	}
	static constexpr t2 id2() {
		return 0ll;
	}
	static t1 op1(const t1& a, const t1& b) {
		return std::min(a, b);
	}
	static t1 op2(const t1& a, const t2& b) {
		return a + b;
	}
	static t2 op3(const t2& a, const t2& b) {
		return a + b;
	}
};

struct RARM {
	using t1 = long long;
	using t2 = long long;
	static constexpr t1 id1() {
		return std::numeric_limits<t1> ::min() / 2;
	}
	static constexpr t2 id2() {
		return 0ll;
	}
	static t1 op1(const t1& a, const t1& b) {
		return std::max(a, b);
	}
	static t1 op2(const t1& a, const t2& b) {
		return a + b;
	}
	static t2 op3(const t2& a, const t2& b) {
		return a + b;
	}
};
template<typename M>
struct LazySegmentTree {

	int n;
	using T1 = typename M::t1;
	using T2 = typename M::t2;
	std::vector<T1> nodes;
	std::vector<T2> lazy;

	LazySegmentTree(std::vector<T1> v) {
		int sz = (int)v.size();
		n = 1; while (n < sz) n *= 2;
		nodes.resize(2 * n - 1, M::id1());
		lazy.resize(2 * n - 1, M::id2());

		for (int i = 0; i < sz; i++) nodes[i + n - 1] = v[i];
		for (int i = n - 2; i >= 0; i--) nodes[i] = M::op1(nodes[i * 2 + 1], nodes[i * 2 + 2]);
	}

	void eval(int k, int l, int r) {
		if (lazy[k] != M::id2()) {
			nodes[k] = M::op2(nodes[k], lazy[k]);
			if (r - l > 1) {
				lazy[2 * k + 1] = M::op3(lazy[2 * k + 1], lazy[k]);
				lazy[2 * k + 2] = M::op3(lazy[2 * k + 2], lazy[k]);
			}
			lazy[k] = M::id2();
		}
	}
	void update(int a, int b, T2 x) {
		update(a, b, x, 0, 0, n);
	}
	T1 query(int a, int b) {
		return query(a, b, 0, 0, n);
	}
private:
	void update(int a, int b, T2 x, int k, int l, int r) {
		eval(k, l, r);
		if (b <= l || r <= a)return;
		if (a <= l && r <= b) {
			lazy[k] = M::op3(lazy[k], x);
			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);
			nodes[k] = M::op1(nodes[2 * k + 1], nodes[2 * k + 2]);
		}
	}

	T1 query(int a, int b, int k, int l, int r) {
		if (b <= l || r <= a)return M::id1();
		eval(k, l, r);
		if (a <= l && r <= b)return nodes[k];
		return M::op1(query(a, b, 2 * k + 1, l, (l + r) / 2), query(a, b, 2 * k + 2, (l + r) / 2, r));
	}
};
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, q;
	cin >> n >> q;
	vector<pair<int, pii>> v(n);
	REP(i, n) {
		int s, t, x;
		cin >> s >> t >> x;
		v[i] = { x,{s,t} };
	}
	sort(ALL(v));
	LazySegmentTree<RU> st(vector<int>(q, -1));
	vi d(q);
	REP(i, q)cin >> d[i];
	RREP(i, n) {
		int a = lower_bound(ALL(d), v[i].second.first - v[i].first) - d.begin();
		int b = lower_bound(ALL(d), v[i].second.second - v[i].first) - d.begin();
		if (b == 0)continue;
		b--;
		st.update(a, b + 1, i);
	}
	REP(i, q) {
		int a = st.query(i, i + 1);
		if (a == -1)cout << -1 << endl;
		else cout << v[a].first << endl;
	}
}

Measured memory_bytes: 9584