#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
//const long long MOD = ;
const long long INF_LL = 1e18+3; const int INF_int = 1e9+3;
#define ll long long
#define rep(i,n) for(int i = 0;i<n;i++)
#define lrep(i,n) for(long long i = 0;i<n;i++)
#define All(a) a.begin(),a.end()
#define Debug_Output_ALL(a) for(auto itr = a.begin();itr!=a.end();itr++) cout << *itr << " ";cout << endl;
template <typename T,typename E>
struct SegmentTree{
  typedef function<T(T,T)> F;
  typedef function<T(T,E)> G;
  typedef function<E(E,E)> H;
  typedef function<E(E,int)> P;
  int n;
  F f;
  G g;
  H h;
  P p;
  T d1;
  E d0;
  vector<T> dat;
  vector<E> laz;
  SegmentTree(int n_,F f,G g,H h,T d1,E d0,
	      vector<T> v=vector<T>(),P p=[](E a,int b){return a;}):
    f(f),g(g),h(h),d1(d1),d0(d0),p(p){
    init(n_);
    if(n_==(int)v.size()) build(n_,v);
  }
  void init(int n_){
    n=1;
    while(n<n_) n*=2;
    dat.clear();
    dat.resize(2*n-1,d1);
    laz.clear();
    laz.resize(2*n-1,d0);
  }
  void build(int n_, vector<T> v){
    for(int i=0;i<n_;i++) dat[i+n-1]=v[i];
    for(int i=n-2;i>=0;i--)
      dat[i]=f(dat[i*2+1],dat[i*2+2]);
  }
  inline void eval(int len,int k){
    if(laz[k]==d0) return;
    if(k*2+1<n*2-1){
      laz[k*2+1]=h(laz[k*2+1],laz[k]);
      laz[k*2+2]=h(laz[k*2+2],laz[k]);
    }
    dat[k]=g(dat[k],p(laz[k],len));
    laz[k]=d0;
  }
  T update(int a,int b,E x,int k,int l,int r){
    eval(r-l,k);
    if(r<=a||b<=l) return dat[k];
    if(a<=l&&r<=b){
      laz[k]=h(laz[k],x);
      return g(dat[k],p(laz[k],r-l));
    }
    return dat[k]=f(update(a,b,x,k*2+1,l,(l+r)/2),
		    update(a,b,x,k*2+2,(l+r)/2,r));
  }
  T update(int a,int b,E x){
    return update(a,b,x,0,0,n);
  }
  T query(int a,int b,int k,int l,int r){
    eval(r-l,k);
    if(r<=a||b<=l) return d1;
    if(a<=l&&r<=b) return dat[k];
    T vl=query(a,b,k*2+1,l,(l+r)/2);
    T vr=query(a,b,k*2+2,(l+r)/2,r);
    return f(vl,vr);
  }
  T query(int a,int b){
    return query(a,b,0,0,n);
  }
};
int main(){
    int n,q;
    cin >> n >> q;
    pair<pair<int,int>,int> traffic[n];
    rep(i,n) cin >> traffic[i].first.first >> traffic[i].first.second >> traffic[i].second;
    rep(i,n){
        int f = traffic[i].first.first;
        int s = traffic[i].first.second;
        traffic[i].first.first=(traffic[i].second+1-s),traffic[i].first.second=(traffic[i].second+1-f);
    }
    sort(traffic,traffic+n);
    int d[q];
    rep(i,q) cin >> d[i];
    set<int> st;
    rep(i,n) st.insert(traffic[i].first.first),st.insert(traffic[i].first.second);
    //Debug_Output_ALL(st);
    map<int,int> mp;
    int t = 0;
    for(auto x: st) mp[x]=t,t++;
    SegmentTree<int,int> tree(st.size(),[](int a,int b){return min(a,b);},[](int a,int b){return min(a,b);},[](int a,int b){return min(a,b);},INF_int,INF_int);
    rep(i,n){
        tree.update(mp[traffic[i].first.first],mp[traffic[i].first.second],traffic[i].second);
        //cout << mp[traffic[i].first.first] << " " << mp[traffic[i].first.second] << " " << traffic[i].second << endl;
    }
    //rep(i,st.size()) cout << tree.query(mp[i],mp[i]+1) << " ";
    //cout << endl;
    rep(i,q) {
        auto itr = st.upper_bound(-d[i]);
        if(itr==st.begin()) cout << -1 << endl;
        else{
            itr--;
            int ans = tree.query(mp[*itr],mp[*itr]+1);
            if(ans==INF_int) cout << -1 << endl;
            else cout << ans << endl;        
        }
    }

}

Measured memory_bytes: 50048