#include<bits/stdc++.h>
#define LL long long

using namespace std;
const int N=1e5+100;
int n,q;
LL a[N];
map<LL,LL> mp ;
void solve(){
    cin >> n >> q ;
    mp.clear() ;
    for (int i = 1 ; i <= n ; i ++ ) {
        cin >> a[i];
    }
    a[n+1] = a[n]+1;
    for (LL i = 1 ; i < n ; i++ ) {
        LL lt = (i) , rt = n-i;
        mp[(LL)(i*(n-i))] += a[i+1] - a[i];
        if(i ==n-1) mp[(LL)(i*(n-i))] += 1;

    }
    for (int i = 1 ; i <= q; i ++ ) {
        LL x ; cin >> x ;
        cout << mp[x] << " " ;
    }
    cout  << '\n';
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}