#include<bits/stdc++.h>

using namespace std;
const int N = 3e5 + 10, M = N - 10;
int n, q;
bitset<N> bt;
array<int, 3> arr[N];
int suf[N];

int get(int x) {
    return M - x;
}

void solve() {
    cin >> n >> q;
    bt[0] = true;
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> arr[i][2] >> arr[i][1] >> arr[i][0];
        bt |= bt << arr[i][2];
        sum += arr[i][2];
    }
    long long mn = 1e18;
    bt[0] = false;
    for (int i = 1; i <= M; i++) {
        if (bt[i]) {
            mn = min(mn, max((long long) i, sum - i));
        }
        bt[i] = false;
    }
    for (int i = 0; i < N; i++)
        bt[i] = false;

    sort(arr, arr + n);

    vector<pair<int, int>> v;

    if (mn <= M)
        v.emplace_back(mn, (*max_element(arr, arr + n))[0]);
    suf[n - 1] = arr[n - 1][1];
    for (int i = n - 2; i >= 0; i--) {
        suf[i] = max(suf[i + 1], arr[i][1]);
    }

    bt[get(0)] = true;

    long long before = 0;
    for (int i = 0; i < n; i++) {
        bt |= bt >> arr[i][2];
        before += arr[i][2];
        sum -= arr[i][2];
        if (before + sum * 2 > M * 2)
            continue;
        auto it = (int) bt._Find_next(get((int) (before + 1) / 2) - 1);
        v.emplace_back(max(get(it), (int) before - get(it)) + sum, max(suf[i + 1], arr[i][0]));
    }
    std::sort(v.begin(), v.end());
    while (q--) {
        int l;
        cin >> l;
        auto it = std::upper_bound(v.begin(), v.end(), make_pair(l, (int) 1e9 + 7));
//        auto it = v.begin();
        if (it == v.begin()) {
            cout << "-1\n";
            continue;
        }
        it--;
        cout << it->second << '\n';
    }
}

int32_t main() {
    std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
    int t = 1;

//    cin >> t;

    cout << fixed << setprecision(10);
    while (t--) {
        solve();
    }

    return 0;
}