/*
Problem : B - 喵了个喵
Solver : pmt2018
*/

#include<bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define fi first 
#define se second

#define _debug(fmt, ...) fprintf(stderr, "\033[91m[%s %3d]: " fmt "\n\033[0m",__func__,__LINE__, ##__VA_ARGS__)

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;

const int maxn = 30007, maxq = 300007, maxl = 300007;
const int INF = 0x3f3f3f3f;
#define MAXL 300000

int N, Q;

struct sheets{
    int d, tfast, tslow;
}s[maxn];

int suf_fast[maxn];
ll sumd[maxn];

bitset<maxl> knapsack;

int ans[maxl];

int main(){
    scanf("%d%d", &N, &Q);
    for (int i = 1; i <= N; i++) {
        scanf("%d%d%d", &s[i].d, &s[i].tfast, &s[i].tslow);
    }

    sort(s + 1, s + N + 1, [](const sheets &a, const sheets &b){
        return a.tslow < b.tslow;
    });

    for (int i = N; i >= 1; i--) {
        suf_fast[i] = max(s[i].tfast, suf_fast[i + 1]);
    }

    for (int i = 1; i <= N; i++) {
        sumd[i] = sumd[i - 1] + (ll)s[i].d;
    }

    for (int i = 0; i <= MAXL; i++) ans[i] = INF;
    if (sumd[N] <= (ll)MAXL) ans[sumd[N]] = suf_fast[1];
    knapsack.set(0);
    for (int i = 1; i <= N; i++) {
        knapsack |= knapsack << s[i].d;
        if (sumd[i] / 2 + sumd[N] - sumd[i] > (ll)MAXL) continue;
        int len = (int)sumd[N] - (int)sumd[i] + (int)knapsack._Find_next((sumd[i] - 1) / 2);
        if(len <= MAXL) ans[len] = max(s[i].tslow, suf_fast[i + 1]);
    }
    
    for (int i = 0; i <= MAXL; i++) {
        ans[i] = min(ans[i - 1], ans[i]);
    }

    while (Q--) {
        int l;
        scanf("%d", &l);
        if (ans[l] == INF) printf("-1\n");
        else printf("%d\n", ans[l]);
    }
    
    
    return 0;
}