#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
   return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
   os << "[";
   bool a = 1;
   for (auto e : v ) {
      os << (a ? "" : " "); 
      os << e;
      a = 0;
   }
   os << "]";
   return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
   os << "(" << p.first << " " << p.second << ")";
   return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
   os << "{";
   bool a = 1;
   for (auto e : mp) {
      os << (a ? "" : " ");
      os << e.first << ":" << e.second;
      a = 0;
   }
   os << "}";
   return os;
}

// std::tuple Debug
template<int N,class Tuple>
void out(ostream &os,const Tuple &t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream &os,const Tuple &t){
   if(N)os<<" ";
   os<<get<N>(t);
   out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream &os, const tuple<Ts...> &t){
   os<<"(";
   out<0,tuple<Ts...>,Ts...>(os,t);
   os<<")";
   return os;
}

// Debug
#define DUMP(x) cout<<#x<<" = "<<(x)<<endl

struct edge { int to, cost; };

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

template<typename T, typename U, typename V>
struct trio {
   T first;
   U second;
   V third;

   bool operator<(const trio<T,U,V>& rhs) const {
      pair<T,pair<U,V>> l{first,{second,third}},
         r{rhs.first,{rhs.second,rhs.third}};
      return l < r;
   }

   bool operator>(const trio<T,U,V>& rhs) const {
      return rhs < *this;
   }
};

// trio Debug
template<typename T, typename U, typename V>
ostream& operator<<(ostream& os, const trio<T, U, V>& t) {
   os << "(" << t.first << " " << t.second << " " << t.third << ")";
   return os;
}

struct event {
   int id, type;
};
ostream& operator<<(ostream& os, const event& e) {
   os << "(" << e.id << " " << e.type << ")";
   return os;
}

int main()
{
   int N, Q; cin >> N >> Q;

   vector<LL> S(N), T(N), X(N);
   for (int i = 0; i < N; ++i) {
      cin >> S[i] >> T[i] >> X[i];
      S[i] -= X[i];
      T[i] -= X[i];
   }

   vector<LL> D(Q);
   for (int i = 0; i < Q; ++i) {
      cin >> D[i];
   }

   // vector<trio<int,int,int>> event(2*N);
   // for (int i = 0; i < N; ++i) {
   //    event[2*i] = { T[i]-X[i], 0, x[i] };
   //    event[2*i+1] = { S[i]-X[i], 1, X[i] };
   // }
   // sort(event.begin(), event.end());
   vector<event> ord(2*N);
   for (int i = 0; i < N; ++i) {
      ord[2*i] = (event){ i, 0 };
      ord[2*i+1] = (event){ i, 1 };
   }

   sort(ord.begin(), ord.end(), [&](event i, event j) {
         LL l = (i.type ? T[i.id] : S[i.id]);
         LL r = (j.type ? T[j.id] : S[j.id]);
         if (l == r) return i.type > j.type;
         return l < r;
         });


   set<LL> st{LINF};
   vector<LL> ans(Q);

   int j = 0;

   for (int i = 0; i < Q; ++i) {
      // for (; event[j].first <= D[i]; ++j) {
      for (; j < 2*N; ++j) {
         int id = ord[j].id;
         int type = ord[j].type;
         LL z = (type ? T[id] : S[id]);

         if (D[i] < z) break;

         if (type == 0) {
            // add event;
            st.insert(X[id]);
         } else {
            // remove event
            st.erase(X[id]);
         }
      }
      ans[i] = *st.begin();
   }

   for (int i = 0; i < Q; ++i) {
      cout << (ans[i] == LINF ? -1 : ans[i]) << endl;
   }

   return 0;
}


Measured memory_bytes: 21632