#include <bits/stdc++.h>
using namespace std;

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-7;
const double INFD = numeric_limits<double>::infinity();
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
#define INF INFINITY
bool feq(double x, double y) { return abs(x - y) <= eps; }
bool fge(double x, double y) { return x >= y - eps; }
double fsqrt(double x) { return feq(x, 0) ? 0 : sqrt(x); }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

/*******************************************************/

class SegTree {
private:
	struct val_t {
		bool enable;
		ll upd, add, min;
	};
	int n, N; // n is the original size, while N is the extended size
	int base;
	vector<val_t> nodes;
	int left_of(int id) {
		if (id >= base) return -1;
		else return id * 2 + 1;
	}
	int right_of(int id) {
		if (id >= base) return -1;
		else return id * 2 + 2;
	}
	int parent_of(int id) {
		if (id == 0) return -1;
		else return (id - 1) >> 1;
	}
	void merge(int id, int id_l, int id_r) {
		nodes[id].min = min(nodes[id_l].min + nodes[id_l].add, nodes[id_r].min + nodes[id_r].add);
	}
	void lazy_rec(int s, int t, int l, int r, int id, ll upd, ll add, bool enable) {
		if (s == l && t == r) {
			if (enable) nodes[id] = { true, upd, add, upd };
			else nodes[id].add += add;
		}
		else {
			int m = (l + r) / 2;
			int id_l = left_of(id);
			int id_r = right_of(id);
			if (!enable) {
				add += nodes[id].add;
				if (nodes[id].enable) {
					upd = nodes[id].upd;
					enable = true;
				}
			}
			nodes[id].enable = false;
			nodes[id].add = 0;
			if (s < m && m < t) {
				lazy_rec(s, m, l, m, id_l, upd, add, enable);
				lazy_rec(m, t, m, r, id_r, upd, add, enable);
			}
			else if (s < m) {
				lazy_rec(s, t, l, m, id_l, upd, add, enable);
				lazy_rec(0, 0, 0, 0, id_r, upd, add, enable);
			}
			else if (m < t) {
				lazy_rec(0, 0, 0, 0, id_l, upd, add, enable);
				lazy_rec(s, t, m, r, id_r, upd, add, enable);
			}
			merge(id, id_l, id_r);
		}
	}
	enum change_t {
		UPD, ADD
	};
	void change_rec(int s, int t, int l, int r, int id, ll x, change_t op) {
		if (s == l && t == r) {
			if (op == UPD) nodes[id] = { true, x, 0, x };
			else if (op == ADD) nodes[id].add += x;
		}
		else {
			int m = (l + r) / 2;
			int id_l = left_of(id);
			int id_r = right_of(id);
			if (s < m && m < t) {
				change_rec(s, m, l, m, id_l, x, op);
				change_rec(m, t, m, r, id_r, x, op);
			}
			else if (s < m) {
				change_rec(s, t, l, m, id_l, x, op);
			}
			else if (m < t) {
				change_rec(s, t, m, r, id_r, x, op);
			}
			merge(id, id_l, id_r);
		}
	}
	enum solve_t {
		MIN
	};
	ll solve_rec(int s, int t, int l, int r, int id, solve_t op) {
		ll v = 0;
		if (s == l && t == r) {
			if (op == MIN) v = nodes[id].min;
		}
		else {
			int m = (l + r) / 2;
			int id_l = left_of(id);
			int id_r = right_of(id);
			if (s < m && m < t) {
				ll v0 = solve_rec(s, m, l, m, id_l, op);
				ll v1 = solve_rec(m, t, m, r, id_r, op);
				if (op == MIN) v = min(v0, v1);
			}
			else if (s < m) {
				v = solve_rec(s, t, l, m, id_l, op);
			}
			else if (m < t) {
				v = solve_rec(s, t, m, r, id_r, op);
			}
		}
		if (op == MIN) v += nodes[id].add;
		return v;
	}
	void lazy(int s, int t) {
		lazy_rec(s, t, 0, N, 0, 0, 0, false);
	}
public:
	SegTree(int n, ll init) {
		this->n = n;
		N = (int)pow(2, ceil(log2(n)));
		base = N - 1;
		nodes = vector<val_t>(base + N, { false, 0, 0, LLONG_MAX });
		upd(0, n, init);
	}
	int cover_size(int id) {
		int cnt = 1;
		while (left_of(id) != -1) {
			id = left_of(id);
			cnt *= 2;
		}
		int l = id - base;
		int r = min(l + cnt, n);
		return max(0, r - l);
	}
	void upd(int s, int t, ll x) {
		lazy(s, t);
		change_rec(s, t, 0, N, 0, x, UPD);
	}
	ll minof(int s, int t) {
		lazy(s, t);
		return solve_rec(s, t, 0, N, 0, MIN);
	}
};

struct val_t {
	ll s, t, x;
	Comp(val_t) {
		return x < another.x;
	}
};

int main() {
	quickio();
	int n, q; cin >> n >> q;
	SegTree *st = new SegTree(q, LLONG_MAX);
	vector<val_t> v(n);
	Loop(i, n) {
		cin >> v[i].s >> v[i].t >> v[i].x;
	}
	sort(v.begin(), v.end());
	vll d(q);
	Loop(i, q) cin >> d[i];
	Loopr(i, n) {
		int l = lower_bound(d.begin(), d.end(), v[i].s - v[i].x) - d.begin();
		int r = lower_bound(d.begin(), d.end(), v[i].t - v[i].x) - d.begin();
		if (l < r) {
			st->upd(l, r, v[i].x);
		}
	}
	Loop(i, q) {
		ll ans = st->minof(i, i + 1);
		if (ans == LLONG_MAX) cout << -1 << endl;
		else cout << ans << endl;
	}
}

Measured memory_bytes: 24576