#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

template <typename T>
struct DualSegmentTree {
  using F = function<T(T, T)>;
  int n;
  vector<T> v;
  F f;
  T e;
  DualSegmentTree(int size, F f, T e) : f(f), e(e) {
    n = 1;
    while (n < size) n <<= 1;
    v.assign(n * 2, e);
  }
  void set(int a, int b, int x, int k = 1, int l = 0, int r = -1) {
    if (r == -1) r = n;
    if (b <= l || r <= a) return;
    if (a <= l && r <= b) { v[k] = f(v[k], x); return; }
    set(a, b, x, k * 2 + 0, l, (l + r) / 2);
    set(a, b, x, k * 2 + 1, (l + r) / 2, r);
  }
  int get(int k) {
    int ans = v[k += n];
    while (k >>= 1) ans = f(ans, v[k]);
    return ans;
  }
};

void solve() {
  int N, Q; cin >> N >> Q;
  set<int> se;
  
  vector<tuple<int, int, int>> st;
  vi32 D(Q);
  rep(i, N) {
    int s, t, x; cin >> s >> t >> x;
    s = max(0, s - x);
    t = max(0, t - x);
    st.emplace_back(s, t, x);
    se.insert(s), se.insert(t);
  }
  rep(i, Q) {
    cin >> D[i];
    se.insert(D[i]);
  }

  vi32 z;
  each(s, se) z.push_back(s);
  int n = z.size();
  auto dst = DualSegmentTree<int>(n, [&](int a, int b) { return min(a, b); }, 2e9);

  rep(i, N) {
    int s, t, x;
    tie(s, t, x) = st[i];
    int a = lower_bound(all(z), s) - z.begin();
    int b = lower_bound(all(z), t) - z.begin();
    dst.set(a, b, x);
  }
  rep(i, Q) {
    int d = D[i];
    int a = lower_bound(all(z), d) - z.begin();
    int ans = dst.get(a);
    if (ans == 2e9) cout << -1 << '\n';
    else cout << ans << '\n';
  }
}


Measured memory_bytes: 46380