#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,inf,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "\n";
    return out;
}

inline int gc(){
	static const int BUF = 1e7;
	static char buf[BUF], *bg = buf + BUF, *ed = bg;
	
	if(bg == ed) fread(bg = buf, 1, BUF, stdin);
	return *bg++;
} 

inline int ri(){
	int x = 0, f = 1, c = gc();
	for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
	for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
	return x*f;
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< string, int > PSI;
typedef set< int > SI;
typedef vector< int > VI;
typedef vector< PII > VPII;
typedef map< int, int > MII;
typedef multimap< int, int > MMII;
typedef unordered_map< int, int > uMII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-10;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 2e5 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

struct Tuple{
	int T, X, D;
	
	inline bool operator< (const Tuple &x) const{
		return T < x.T;
	}
};

int N, Q;
Tuple event[maxN << 1];
int len;
multiset< int > msi;

int main(){
	//INIT(); 
	N = ri();
	Q = ri();
	For(i, 1, N) {
		int S, T, X;
		S = ri();
		T = ri();
		X = ri();
		
		event[++len].T = S - X;
		event[len].X = X;
		event[len].D = 1;
		
		event[++len].T = T - X;
		event[len].X = X;
		event[len].D = 0;
	}
	sort(event + 1, event + len + 1);
	
	int k = 1, D;
	For(i, 1, Q) {
		D = ri();
		//********************************************************************
		while(k <= len) {
			if(event[k].T <= D) {
				if(event[k].D) msi.insert(event[k].X);
				else msi.erase(msi.find(event[k].X));
				++k;
			}
			else break;
		}
		
		/*
		血的教训，一开始我写的不是while循环，而是for循环，貌似是没问题
		但是提交一直超时，原因是某些案例使得else分支一直没有执行到，于是时间复杂度就激增了
		贴上错误代码，引以为戒 
		For(j, k, len) {
			if(event[j].T <= D) {
				if(event[j].D) msi.insert(event[j].X);
				else msi.erase(msi.find(event[j].X));
				++k;
			}
			else {
				k = j;
				break;
			}
		} 
		*/
		
		//********************************************************************
		
		int ans = -1;
		if(msi.size()) ans = *msi.begin(); 
		printf("%d\n", ans);
	}
    return 0;
}


Measured memory_bytes: 24960