#include<bits/stdc++.h>
using namespace std; 
char nl = '\n';
using i64 = long long;

struct fenwick {
    vector<i64> bit;
    int n;
    fenwick(int sz) {
        n = sz;
        bit.resize(sz);
    }
    void upd(int i, i64 d) {
        while(i < n) {
            bit[i] += d;
            i |= (i + 1);
        }
    }
    void build(vector<i64>& A) {
        for(int i = 0; i < n; i++) {
            upd(i, A[i]);
        }
    }
    i64 sum(int r) {
        i64 ans = 0;
        while(r >= 0) {
            ans += bit[r];
            r = (r & (r + 1)) - 1;
        }
        return ans;
    }
    i64 get_sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }
};

void solve(int t) {
    // cout << "test #" << t << << nl;
    int n, q; cin >> n >> q;
    vector<i64> A(n);
    i64 tot = 0;
    for(auto& a : A) cin >> a, tot += a;
    map<i64, vector<int>> idx;
    vector<i64> aux = A;
    sort(aux.begin(), aux.end());
    for(int i = 0; i < n; i++) {
        idx[aux[i]].push_back(i);
    }
    fenwick fen(n), cnt(n);
    for(int i = 0; i < n; i++) fen.upd(i, aux[i]);
    for(int i = 0; i < n; i++) cnt.upd(i, 1);
    auto ask = [&](int x) -> int {
        int s = 0, e = n - 1;
        int ans = 0;
        while(s <= e) {
            int mid = (s + e) >> 1;
            int cur = cnt.sum(mid);
            if(cur <= x) {
                ans = mid; s = mid + 1;
            } else e = mid - 1;
        }
        return ans;
    };
    vector<i64> ans(n);
    for(int i = n - 1; i >= 0; i--) {
        if(i % 2 == 0) {
            int j = ask(i / 2);
            ans[i] = tot - (2LL * fen.sum(j));
        }
        tot -= A[i];
        cnt.upd(idx[A[i]].back(), -1);
        fen.upd(idx[A[i]].back(), -A[i]);
        idx[A[i]].pop_back();
    }
    while(q--) {
        int k; cin >> k; 
        cout << ans[--k] << " ";
    }
    cout << nl;
} 

int main() {
    int tt = 1;
    cin >> tt;
    for(int t = 1; t <= tt; t++) solve(t);
}