#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 300000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
double dot(complex<double> a, complex<double> b) {
	return a.real()* b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real()* b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(cosine);
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size(); ++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa > now_min) {
					now_min = goa;
					now_go = i;
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
pair<long long,long long> seg_tree[seg_size*4];
pair<long long,long long> seg_find(long long now, long long n_l, long long n_r, long long w_l, long long w_r) {
	if (w_l <= n_l && n_r <= w_r) return seg_tree[now];
	if (n_r <= w_l || w_r <= n_l) return make_pair(0, 0);
	pair<long long,long long> a = seg_find(now * 2, n_l, (n_l + n_r) / 2, w_l, w_r),b = seg_find(now * 2 + 1, (n_l + n_r) / 2, n_r, w_l, w_r);
	a.first += b.first;
	a.second += b.second;
	return a;
}
long long seg_set(int now) {
	seg_tree[now] = make_pair(seg_tree[now * 2].first + seg_tree[now * 2 + 1].first, seg_tree[now * 2].second + seg_tree[now * 2 + 1].second);
	if (now != 1) seg_set(now / 2);
	return 0;
}
long long inv(long long now) {
	long long now_go = MAX_MOD - 2LL;
	long long ans = 1;
	while (now_go != 0) {
		if (now_go % 2 == 1) {
			ans *= now;
			ans %= MAX_MOD;
		}
		now *= now;
		now %= MAX_MOD;
		now_go /= 2;
	}
	return ans;
}
int gcd(int a, int b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
long long ng[500000] = {};
long long ans[500000] = {};
int main(){
	iostream::sync_with_stdio(false);
#define int long long
	int n, query;
	cin >> n >> query;
	vector<tuple<long long, long long,long long>> input;
	map<long long,long long> temp;
	REP(i, n) {
		long long a, b, c;
		cin >> a >> b >> c;
		temp[a - c] = 0;
		temp[b - c] = 0;
		input.push_back(make_tuple(a, b, c));
	}
	long long tmp = 0;
	for (auto i = temp.begin(); i != temp.end(); ++i) {
		i->second = tmp;
		tmp++;
	}
	priority_queue<pair<long long, long long>, vector<pair<long long, long long>>, greater<pair<long long, long long>>> next;
	vector<tuple<long long,long long, long long,long long>> events;
	const int INSERT = 1;
	const int DELETE = 0;
	REP(i, n) {
		events.push_back(make_tuple(temp[get<0>(input[i]) - get<2>(input[i])],get<2>(input[i]),i, INSERT));
		events.push_back(make_tuple(temp[get<1>(input[i]) - get<2>(input[i])],get<2>(input[i]),i, DELETE));
	}
	sort(events.begin(), events.end());
	long long go_itr = 0;
	for (int i = 0; i < events.size(); ++i) {
		if (get<3>(events[i]) == INSERT) {
			next.push(make_pair(get<1>(events[i]), get<2>(events[i])));
		}
		else if (get<3>(events[i]) == DELETE) {
			ng[get<2>(events[i])] = 1;
			while (next.empty() == false && ng[next.top().second] == 1) {
				next.pop();
			}
		}
		if (i == events.size() - 1 || get<0>(events[i]) != get<0>(events[i + 1])) {
			if (next.empty() == true) {
				ans[go_itr] = LONG_INF;
			}
			else {
				ans[go_itr] = next.top().first;
			}
			go_itr++;
		}
	}
	REP(i, query) {
		long long a;
		cin >> a;
		auto q = temp.lower_bound(a);
		long long ans_bound = 0;
		if (q != temp.end()&&q ->first == a) {
			ans_bound = q->second;
		}
		else if (q != temp.begin()) {
			q--;
			ans_bound = q->second;
		}
		else {
			cout << -1 << endl;
			continue;
		}
		if (ans[ans_bound] == LONG_INF) {
			cout << -1 << endl;
		}
		else {
			cout << ans[ans_bound] << endl;
		}
	}
}

Measured memory_bytes: 57636