#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=1e6+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

typedef pair<ii,ll> iii;
ll n,q,sz;
iii d[MAXn];
ll seg[MAXn<<1];
ll st[MAXn];
vector<ll> _;
void ins(ll l,ll r,ll v){
    for (l += sz,r += sz;l<r;l>>=1,r>>=1) {
        if (l&1) {
            seg[l] = min(seg[l],v);
            l++;
        }
        if (r&1) {
            r--;
            seg[r] = min(seg[r],v);
        }
    }
}
ll qr(ll l){
    ll ret = INF;
    for (l += sz;l > 0;l>>=1) ret = min(ret,seg[l]);
    return ret;
}
int main(){
    IOS();
    cin >> n >> q;
    RST(seg,INF);
    REP (i,n) {
        ll l,r,x;
        cin >> l >> r >> x;
        d[i] = iii(ii(l,r),x);
        _.eb(max(0LL,l-x)),_.eb(max(0LL,r-x));
        _.eb(max(0LL,l-x-1)),_.eb(max(0LL,r-x+1));
    }
    REP (i,q) {
        cin >> st[i];
        _.eb(st[i]);
    }
    sort(ALL(_));
    _.resize(unique(ALL(_))-_.begin());
    sz = SZ(_);
    REP (i,n) {
        ll l = lower_bound(ALL(_),max(0LL,d[i].X.X-d[i].Y))-_.begin();
        ll r = lower_bound(ALL(_),max(0LL,d[i].X.Y-d[i].Y))-_.begin();
        ll v = d[i].Y;
        ins(l,r,v);
    }

    REP (i,q) {
        ll cur = lower_bound(ALL(_),st[i]) - _.begin();
        ll ans = qr(cur);
        if (ans == INF) cout << -1 << endl;
            else cout << qr(cur) << endl;
    }
}


Measured memory_bytes: 33896