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

int main() {
  long n,q;
  cin >> n >> q;
  vector<long> s(n);
  vector<long> t(n);
  vector<long> x(n);
  vector<long> d(q);
  vector<vector<long>> aaa;
  map<long,long> bbb;
  for(long i=0;i<n;i++) cin >> s[i] >> t[i] >> x[i];
  for(long i=0;i<q;i++) cin >> d[i];

  for(long i=0;i<n;i++) {
    aaa.push_back({s[i]-x[i],0,x[i]});
    aaa.push_back({t[i]-x[i]-1,2,x[i]});
  }
  for(long i=0;i<q;i++) aaa.push_back({d[i],1});
  
  sort(aaa.begin(),aaa.end());
  for(long i=0;i<aaa.size();i++) {
    if(aaa[i][1]==0) {
      bbb[aaa[i][2]]++;
    } else if(aaa[i][1]==1) {
      if(bbb.size()==0) cout << -1 << endl;
      else cout << (*bbb.begin()).first << endl;
    } else {
      bbb[aaa[i][2]]--;
      if((*bbb.find(aaa[i][2])).second==0)  bbb.erase(bbb.find(aaa[i][2]));
    }
  }
}