#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 303030
#define MAXS 70
#define INF 1'000'000'100'000'000'000
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1'000'000'007
#define TC 1
typedef unsigned long long int ull;
int D[MAX];
int S[MAX];
int t1[MAX];
int t2[MAX];
const int BMAX = 10010;
const int LMAX = 300'000;
ull bset[BMAX];
int ans[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N, Q;
	cin >> N >> Q;
	int i, j;
	for (i = 0; i <= LMAX; i++) ans[i] = 1e9 + 100;
	int d, a, b;
	vector<tuple<int, int, int>> vt;
	for (i = 0; i < N; i++) {
		cin >> d >> a >> b;
		vt.emplace_back(b, a, d);
	}
	sort(vt.begin(), vt.end());
	ll sumd = 0;
	for (i = 1; i <= N; i++) {
		tie(t2[i], t1[i], D[i]) = vt[i - 1];
		sumd += D[i];
	}
	if (sumd > 600'000) {
		while (Q--) cout << -1 << ln;
		return 0;
	}
	int t1max = 0;
	for (i = 1; i <= N; i++) S[i] = S[i - 1] + D[i], t1max = max(t1max, t1[i]);
	bset[0] = 1;
	if (S[N] <= LMAX) ans[S[N]] = t1max;
	for (i = 1; i <= N; i++) {
		int d = D[i];
		int q = d >> 6;
		int r = d & 63;
		for (j = BMAX - 1; j >= 0; j--) {
			if (j + q < BMAX) bset[j + q] |= (bset[j] << r);
			if (j + q + 1 < BMAX && r) bset[j + q + 1] |= (bset[j] >> (64 - r));
		}
		int s = S[i];
		int m = s / 2;
		int mv = s;
		vector<int> rv;
		for (j = (m / 64) + 1; j < BMAX; j++) {
			if (bset[j]) {
				rv.push_back(j);
				break;
			}
		}
		for (j = (m / 64) - 1; j >= 0; j--) {
			if (bset[j]) {
				rv.push_back(j);
				break;
			}
		}
		if (bset[m / 64]) rv.push_back(m / 64);
		for (auto c : rv) {
			for (j = 0; j < 64; j++) {
				if (bset[c] >> j & 1) {
					int loc = c * 64 + j;
					mv = min(mv, max(loc, s - loc));
				}
			}
		}
		if (mv + S[N] - S[i] <= LMAX) ans[mv + S[N] - S[i]] = min(ans[mv + S[N] - S[i]], max(t1max, t2[i]));
	}
	for (i = 1; i <= LMAX; i++) ans[i] = min(ans[i], ans[i - 1]);
	while (Q--) {
		int l;
		cin >> l;
		if (ans[l] >= 1e9 + 10) cout << -1 << ln;
		else cout << ans[l] << ln;
	}
}