#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>

#define all(v) (v).begin(), (v).end()

using namespace std;
using Int = long long;
// BEGIN CUT HERE
template <typename T, typename E>
struct SegmentTree {
  using F = function<T(T, T)>;
  using G = function<T(T, E)>;
  using H = function<E(E, E)>;
  int n, height;
  F f;
  G g;
  H h;
  T ti;
  E ei;
  vector<T> dat;
  vector<E> laz;
  SegmentTree(F f, G g, H h, T ti, E ei) : f(f), g(g), h(h), ti(ti), ei(ei) {}

  void init(int n_) {
    n = 1;
    height = 0;
    while (n < n_) n <<= 1, height++;
    dat.assign(2 * n, ti);
    laz.assign(2 * n, ei);
  }
  void build(const vector<T> &v) {
    int n_ = v.size();
    init(n_);
    for (int i = 0; i < n_; i++) dat[n + i] = v[i];
    for (int i = n - 1; i; i--)
      dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
  }
  inline T reflect(int k) { return laz[k] == ei ? dat[k] : g(dat[k], laz[k]); }
  inline void eval(int k) {
    if (laz[k] == ei) return;
    laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);
    laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);
    dat[k] = reflect(k);
    laz[k] = ei;
  }
  inline void thrust(int k) {
    for (int i = height; i; i--) eval(k >> i);
  }
  inline void recalc(int k) {
    while (k >>= 1) dat[k] = f(reflect((k << 1) | 0), reflect((k << 1) | 1));
  }
  void update(int a, int b, E x) {
    thrust(a += n);
    thrust(b += n - 1);
    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) laz[l] = h(laz[l], x), l++;
      if (r & 1) --r, laz[r] = h(laz[r], x);
    }
    recalc(a);
    recalc(b);
  }
  void set_val(int a, T x) {
    thrust(a += n);
    dat[a] = x;
    laz[a] = ei;
    recalc(a);
  }
  T query(int a, int b) {
    thrust(a += n);
    thrust(b += n - 1);
    T vl = ti, vr = ti;
    for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if (l & 1) vl = f(vl, reflect(l++));
      if (r & 1) vr = f(reflect(--r), vr);
    }
    return f(vl, vr);
  }

  template <typename C>
  int find(int st, C &check, T &acc, int k, int l, int r) {
    if (l + 1 == r) {
      acc = f(acc, reflect(k));
      return check(acc) ? k - n : -1;
    }
    eval(k);
    int m = (l + r) >> 1;
    if (m <= st) return find(st, check, acc, (k << 1) | 1, m, r);
    if (st <= l && !check(f(acc, dat[k]))) {
      acc = f(acc, dat[k]);
      return -1;
    }
    int vl = find(st, check, acc, (k << 1) | 0, l, m);
    if (~vl) return vl;
    return find(st, check, acc, (k << 1) | 1, m, r);
  }
  template <typename C>
  int find(int st, C &check) {
    T acc = ti;
    return find(st, check, acc, 1, 0, n);
  }
};

int main() {
  int N, Q;
  int s, t, x, d;
  using Tri = tuple<int, int, int>;
  vector<Tri> inputs;
  vector<int> seps, walkers;
  auto f = [](int a, int b) { return min(a, b); };
  SegmentTree<int, int> ch(f, f, f, 1e9, 1e9);

  cin >> N >> Q;

  //save inputs
  for (int i = 0; i < N; i++) {
    cin >> s >> t >> x;
    inputs.push_back(Tri(s - x, t - x, x));
    seps.push_back(s - x);
    seps.push_back(t - x);
  }
  for (int i = 0; i < Q; i++) {
    cin >> d;
    seps.push_back(d);
    walkers.push_back(d);
  }

  //za-atsu
  sort(all(seps));
  seps.erase(unique(all(seps)), seps.end());
  ch.build(vector<int>(seps.size(), 1e9));
  for (auto i : inputs) {
    s = lower_bound(all(seps), get<0>(i)) - seps.begin();
    t = lower_bound(all(seps), get<1>(i)) - seps.begin();
    x = get<2>(i);
    ch.update(s, t, x);
  }
  for (auto w : walkers) {
    d = lower_bound(all(seps), w) - seps.begin();
    d = ch.query(d, d + 1);
    cout << (d == 1e9 ? -1 : d) << endl;
  }
  return 0;
}


Measured memory_bytes: 27040