#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

// segtree {{{
class segtree {
  private:
    int size;
    vector<Z> data;
    void query_impl(int left, int right, int node, int a, int b, Z v) {
      if (right <= a || b <= left) return;
      if (left <= a && b <= right) {
        ix(data, node) = min(ix(data, node), v);
        return;
      }
      query_impl(left, right, 2 * node + 1, a, (a + b) / 2, v);
      query_impl(left, right, 2 * node + 2, (a + b) / 2, b, v);
    }
  public:
    segtree(int n) {
      size = 1;
      while (size < n) size *= 2;
      data.resize(size * 2 - 1, INF);
    }

    Z min_at(int i) {
      Z node = i + size - 1;
      Z result = ix(data, node);
      while (node > 0) {
        node = (node - 1) / 2;
        result = min(result, ix(data, node));
      }
      return result;
    }

    void update(int left, int right, Z v) {
      query_impl(left, right, 0, 0, size, v);
      dump(left);
      dump(right);
      dump(v);
      dump(data);
    }
};
// }}}

pair<map<Z, Z>, vector<Z>> compress(vector<Z> coords) {
  sort(begin(coords), end(coords));
  auto last = unique(begin(coords), end(coords));
  map<Z, Z> compressed;
  for (auto i = 0; i < last - begin(coords); i++)
    compressed[ix(coords, i)] = i;
  return {compressed, vector<Z>(begin(coords), last)};
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N, Q;
  cin >> N >> Q;
  vector<Z> ss(N), ts(N), xs(N), ds(Q);
  vector<Z> raw;
  for (auto i = 0; i < N; i++) {
    cin >> ix(ss, i) >> ix(ts, i) >> ix(xs, i);
    raw.push_back(ix(ss, i) - ix(xs, i));
    raw.push_back(ix(ts, i) - ix(xs, i));
  }
  cin >> ds;
  for (auto&& d : ds)
    raw.push_back(d);
  map<Z, Z> coords;
  vector<Z> points;
  tie(coords, points) = compress(move(raw));
  dump(coords);
  dump(points);
  segtree tree(points.size());
  for (auto i = 0; i < N; i++)
    tree.update(coords[ix(ss, i) - ix(xs, i)], coords[ix(ts, i) - ix(xs, i)], ix(xs, i));
  debug {
    for (auto i = 0; i < coords.size(); i++) {
      cerr << tree.min_at(i) << ' ';
    }
    cerr << endl;
  }
  for (auto i = 0; i < Q; i++) {
    Z d = tree.min_at(coords[ix(ds, i)]);
    cout << (d == INF ? -1 : d) << endl;
  }
}



Measured memory_bytes: 91368