#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
#include <time.h>
#include <random>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

long long int INF = 3e18;
double Pi = 3.1415926535897932384626;

//vector<ll> G[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←


#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl


ll mod = 1000000007;
ll rui(ll number1,ll number2){

    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){

    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){

    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){

    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

/*
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
	rfact[800000] = rui(fact[800000],mod - 2);
	for(ll i=800000; i>=1; i--){
	   rfact[i-1] = rfact[i] * i;
	   rfact[i-1] %= mod;
	}
	return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/

ll n,m,num,sum,ans,a,b,c,d,e,g,h,w,i,j,k,q,l,r;
ll x[500005],y[500005],z[500005];
ll t[500005],table[700005];
//bool used[500005];
bool flag,dame;

ll segtree[2097151];
ll segn;
 
void seginit(ll n_){

    segn = 1;
    while(segn < n_)segn *= 2;
    for(ll i=0;i<2*segn-1;i++)segtree[i] = INF;
}
void paint(ll a,ll b,ll k,ll l,ll r,ll times){

    if(r <= a || b <= l){
		return;
    }else if(a <= l && r <= b){
        segtree[k] = times;
        return;
    }else{
        paint(a,b,k*2+1,l ,(l + r)/2,times);
        paint(a,b,k*2+2,(l + r )/2,r,times);
        return;
    }
}
ll query(ll a,ll k,ll l,ll r){

    if(r <= a || a < l){
        return INF;
    }else if(a == l && r == a + 1){
        return segtree[k];
    }else{
        ll one = query(a,k * 2 + 1,l,(l + r)/2);
        ll two = query(a,k * 2 + 2,(l + r)/2,r);
        ll three = segtree[k];
        one = min(one,two);
        return min(one,three);
    }
}


ll encode(ll c){
	ll py = lb(table,table+num,c) - lb(table,table+num,-INF);
	assert(py>=0);
	return py;
}

int main(){
	cin >> n >> k;
	assert(n <= 200000 && k <= 200000);
	tuple <ll,ll,ll> ban[200005];
	num = 0;
	table[num] = -INF;
	num++;
	table[num] = 0;
	num++;
	table[num] = INF;
	num++;

	for(i=0;i<n;i++){
		cin >> a >> b >> c;
		get<0>(ban[i]) = c;
		get<1>(ban[i]) = a;
		get<2>(ban[i]) = b;
	}
	sort(ban,ban+n);
	reverse(ban,ban+n);
	for(i=0;i<n;i++){
		x[i] = get<1>(ban[i]);
		y[i] = get<2>(ban[i]);
		z[i] = get<0>(ban[i]);
			table[num] = x[i]-z[i];
			num++;
		
			table[num] = y[i]-z[i];
			num++;
		
	}
	for(i=0;i<k;i++){
		cin >> t[i];
			table[num] = t[i];
			num++;
		
	}
	assert(num <= 600005);
	sort(table,table+num);

	for(i=0;i<num;i++){
		//pe(i);p(table[i]);
	}
	seginit(num);
	for(i=0;i<n;i++){
		paint(encode(x[i]-z[i]),encode(y[i]-z[i]),0,0,segn,z[i]);
	}
	for(i=0;i<k;i++){
		ans = query(encode(t[i]),0,0,segn);
		if(ans != INF){
			p(ans);
		}else{
			p(-1);
		}
	}
	return 0;
}

Measured memory_bytes: 43392