#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
bool be;
constexpr int N = 1e5 + 5;
int n, m, b[N], suf[N], pre[N];
struct node {
	int x, t, s;
}a[N];
bool en;
int main()
{
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n--------------------------------" << endl;
#ifdef IAKIOI
	freopen("in.in", "r", stdin);
//	freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) cin >> a[i].x >> a[i].t >> a[i].s;
	sort(a + 1, a + 1 + n, [](node a, node b) {
		return a.x < b.x;
	});
	for (int i = 1; i <= n; ++i) b[i] = a[i].x;
	for (int i = 1; i <= n; ++i) {
		pre[i] = max(pre[i - 1], a[i].t + b[i]);
	}
	for (int i = n; i >= 1; --i) {
		suf[i] = max(suf[i + 1], a[i].t - b[i]);
	}
	while (m--) {
		int x;
		cin >> x;
		int p = lower_bound(b + 1, b + 1 + n, x) - b;
		cout << max(suf[p] + x, pre[p - 1] - x) << ' ';
	}
	return 0;
}