#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using vi = vector<int>;
using i64 = long long;
using B = bitset<300030>;

struct S {
  int d;
  int one, two;
  int wst;
};
int main() {
  int n, q;
  cin >> n >> q;
  vector<S> vt(n+1);
  i64 sum = 0;
  for (int i = 1; i <= n; ++i) {
    scanf("%d %d %d", &vt[i].d, &vt[i].two, &vt[i].one);
    sum += vt[i].d;
  }
  sort(vt.begin()+1, vt.end(), [&](auto x, auto y){ return x.one < y.one; });
  for (int i = n; i > 0; --i) {
    vt[i].wst = vt[i].two;
    if (i < n) {
      vt[i].wst = max(vt[i].wst, vt[i+1].wst);
    }
  }
  vector<pii> opt;
  const i64 lim = 300000;
  if (sum <= lim) {
    opt.emplace_back(sum, vt[1].wst);
  }
  B dp;
  dp[0] = 1;
  i64 sum2 = 0;
  for (int i = 1; i <= n; ++i) {
    sum -= vt[i].d;
    sum2 += vt[i].d;
    dp |= dp << vt[i].d;
    int bst = dp._Find_next((sum2+1) / 2 - 1);
    if (bst + sum <= lim) {
      int rig = 0;
      if (i < n) {
        rig = vt[i+1].wst;
      }
      opt.emplace_back(bst + sum, max(vt[i].one, rig));
    }
  }
  sort(opt.begin(), opt.end());
  for (int i = 1; i < opt.size(); ++i) {
    opt[i].second = min(opt[i].second, opt[i-1].second);
  }
  while (q--) {
    int len;
    scanf("%d", &len);
    pii e{len, lim+10};
    auto it = upper_bound(opt.begin(), opt.end(), e);
    if (it == opt.begin()) {
      puts("-1");
    } else {
      --it;
      cout << it->second << "\n";
    }
  }
  return 0;
}