#include <stdio.h>

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        int n, q;
        scanf("%d%d", &n, &q);
        long long a[n + 1], sum[n + 1];
        sum[0] = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%lld", &a[i]);
            sum[i] = a[i] + sum[i - 1];
        }
        while (q--) {
            long long k;
            scanf("%lld", &k);
            int l = 1, r = n;
            int maxIndex = 0;
            while (l <= r) {
                int mid = l + (r - l) / 2;
                if (a[mid] > k) {
                    r = mid - 1;
                } else {
                    maxIndex = mid;
                    l = mid + 1;
                }
            }
            printf("%lld ", sum[maxIndex]);
        }
        printf("\n");
    }
    return 0;
}