#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1 << 30;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, -1, 0, 1}, dx4 = {1, 0, -1, 0};    // 右，上，左，下
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };


class CoordinateCompression {
public:
    int no = 0;
    std::unordered_map<long long, int> zip;    // 元の値 -> 圧縮した値
    std::unordered_map<int, long long> unzip;  // 圧縮した値 -> 元の値

    CoordinateCompression(const std::vector<long long> &v) {
        std::set<long long> s(v.begin(), v.end());

        for (long long x : s) {
            this->zip[x] = this->no;
            this->unzip[this->no] = x;
            this->no++;
        }
    }
};

template <typename T> class LazySegmentTree {
private:
    const int array_size;
    int n;
    std::vector<T> data, lazy;
    const std::function<T (T, T)> f;     // 要素に適用する演算
    const std::function<T (T, T)> g;     // 作用素の適用
    const std::function<T (T, T)> h;     // 作用素の合成
    const std::function<T (T, int)> p;
    const T unit;
    const T lazy_unit;

public:
    class Mode {
    public:
        std::function<T (T, T)> f;
        std::function<T (T, T)> g;
        std::function<T (T, T)> h;
        std::function<T (T, int)> p;
        T unit;
        T lazy_unit;
    };

    enum Query {
        RangeMinimumQuery,
        RangeMaximumQuery,
        RangeSummationQuery,
    };

    enum Operation {
        Update,
        Add,
    };

    LazySegmentTree(const std::vector<LL> &v, const Mode mode) : array_size(v.size()),  f(mode.f), g(mode.g), h(mode.h), p(mode.p), unit(mode.unit), lazy_unit(mode.lazy_unit){
        n = 1;
        while (n < array_size) { n *= 2; }
        data.resize(2 * n - 1, unit);
        lazy.resize(2 * n - 1, lazy_unit);

        for (int i = 0; i < array_size; ++i) {
            data[i + n - 1] = v[i];
        }
        for (int i = n - 2; i >= 0; i--) {
            data[i] = f(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }

    static Mode getMode(const Query query, const Operation operation) {
        Mode mode;
        if (query == RangeMinimumQuery) {
            mode.unit = INT_MAX;

            mode.f = [](T a, T b) { return std::min(a, b); };
            if (operation == Update) {
                mode.lazy_unit = -1;
                mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
                mode.h = mode.g;
                mode.p = [&](T a, int len) { return a; };
            }
            else if (operation == Add) {
                mode.lazy_unit = 0;
                mode.g = [](T a, T b) { return a + b; };
                mode.h = mode.g;
                mode.p = [](T a, int len) { return a; };
            }
        }
        else if (query == RangeMaximumQuery) {
            mode.unit = -INT_MAX;

            mode.f = [](T a, T b) { return std::max(a, b); };
            if (operation == Update) {
                mode.lazy_unit = -1;
                mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b; };
                mode.h = mode.g;
                mode.p = [](T a, int len) { return a; };
            }
            else if (operation == Add) {
                mode.lazy_unit = 0;
                mode.g = [](T a, T b) { return a + b; };
                mode.h = mode.g;
                mode.p = [](T a, int len) { return a; };
            }
        }
        else if (query == RangeSummationQuery) {
            mode.unit = 0;

            mode.f = [](T a, T b) { return a + b; };
            if (operation == Update) {
                mode.lazy_unit = INT_MAX;
                mode.g = [&](T a, T b) { return b == mode.lazy_unit ? a : b;};
                mode.h = mode.g;
                mode.p = [&](T a, int len) {return a == mode.lazy_unit ? a : a * len;};
            }
            else if (operation == Add) {
                mode.lazy_unit = 0;
                mode.g = [](T a, T b) { return a + b;};
                mode.h = [](T a, T b) { return a + b;};
                mode.p = [](T a, int len) {return a * len;};
            }
        }
        return mode;
    }

    // array[idx]
    // log(N)
    T access(const int idx) {
        return query(idx, idx + 1, 0, 0, n);
    }

    // operation(array[idx], x)
    // log(N)
    void operation(const int idx, const T x) {
        operation(idx, idx + 1, x);
    }

    // operation(array[left, right), x)
    // log(N)
    void operation(const int left, const int right, const T x) {
        assert(0 <= left and left < right and right <= array_size);
        operation(left, right, x, 0, 0, n);
    }

    // op(array[a, b))
    // log(N)
    T query(const int left, const int right) {
        return query(left, right, 0, 0, n);
    }

private:
    T operation(const int a, const int b, const T x, const int k, const int l, const int r) {
        propagate(k, r - l);

        // 範囲外
        if (b <= l or r <= a) {
            return data[k];
        }
        // 完全に含む
        else if (a <= l and r <= b) {
            lazy[k] = h(lazy[k], x);
            propagate(k, r - l);
            return g(data[k], p(lazy[k], r - l));
        }
        // 一部含む
        else {
            T lv = operation(a, b, x, 2 * k + 1, l, (l + r) / 2);    // 左の子
            T rv = operation(a, b, x, 2 * k + 2, (l + r) / 2, r);    // 右の子
            return data[k] = f(lv, rv);
        }
    }

    // [a, b)の目的値をノードk（区間[l, r]）から検索
    T query(const int a, const int b, const int k, const int l, const int r) {
        propagate(k, r - l);

        // 範囲外
        if (b <= l or r <= a) {
            return unit;
        }
        // 完全に含む
        else if (a <= l && r <= b) {
            return data[k];
        }
        // 一部含む
        else {
            T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);    // 左の子
            T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);    // 右の子
            return f(vl, vr);
        }
    }

    void propagate(const int k, const int len) {
        if (lazy[k] == lazy_unit) {
            return;
        }

        if (len > 1) {
            lazy[k * 2 + 1] = h(lazy[k * 2 + 1], lazy[k]);
            lazy[k * 2 + 2] = h(lazy[k * 2 + 2], lazy[k]);
        }
        data[k] = g(data[k], p(lazy[k], len));
        lazy[k] = lazy_unit;
    }
};

using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N, Q;
    cin >> N >> Q;

    vector<LL> data;
    auto s = make_v<tuple<LL, LL, LL>>(N);
    FOR(i, 0, N) {
        LL S, T, X;
        cin >> S >> T >> X;
        s[i] = make_tuple(X, S, T);

        LL b = max(0LL, S - X);
        LL e = max(0LL, T - X);
        data.emplace_back(b);
        data.emplace_back(e);
    }

    auto D = make_v<LL>(Q);
    FOR(i, 0, Q) {
        cin >> D[i];
        data.emplace_back(D[i]);
    }

    CoordinateCompression cc(data);

    vector<LL> v(cc.no + 100, -1);
    auto mode = LazySegmentTree<LL>::getMode(LazySegmentTree<LL>::RangeSummationQuery, LazySegmentTree<LL>::Update);
    LazySegmentTree<LL> lst(v, mode);
    sort(RALL(s));
    FOE(t, s) {
        LL S, T, X;
        tie(X, S, T) = t;

        LL b = max(0LL, S - X);
        LL e = max(0LL, T - X);
        if (b == e) {
            continue;
        }
        lst.operation(cc.zip[b], cc.zip[e], X);
    }

    FOE(d, D) {
        auto ans = lst.access(cc.zip[d]);
        print(ans);
    }

    return 0;
}


Measured memory_bytes: 115816