scuza(bs).cpp

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


using namespace __gnu_pbds;

// for ordered_set(policy based data structure)
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define faster_ayman    ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int             long long
#define pb              push_back
#define rep(i, a, b)    for (auto i = a; i < b; i++)
#define all(a)          (a).begin(), (a).end()
#define testcase        int tt;cin >> tt;while (tt--)
#define inf             1e18
#define _               << ' ' <<


typedef vector<int>                         vi;
typedef vector<pair<int,int>>               vp;
typedef vector<double>                      vd;
typedef vector<char>                        vc;
typedef set<int>                            si;
typedef set<char>                           sc;
typedef unordered_set<int>                  usi;

void solve() {
    int n, q;                   cin >> n >> q;
    vi a(n), k(q);
    for (auto &x : a)           cin >> x;
    vi pfSum(n, a[0]), notun(n, a[0]);
    rep(i, 1, n) {
        notun[i] = max(notun[i - 1], a[i]);
        pfSum[i] = pfSum[i - 1] + a[i];
    }
    for (auto &x : k)           cin >> x;
    
    vi ans;
    for (auto x : k) {
        
        auto pos = upper_bound(all(notun), x) - notun.begin() - 1;

        pos == -1? ans.pb(0) : ans.pb(pfSum[pos]);
    }
    for (auto x : ans) cout << x << ' ';
    cout << '\n';
}

signed main() {
    
    faster_ayman
    testcase {
        solve();
    }
    
    return 0;
}