#include <bits/stdc++.h>
using namespace std;
using ll =  long long;
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define PI pair<ll,int>
#define fi first
#define se second
#define mp make_pair

const int N=200005;
int n,m,L[N],R[N],d[N],q[N],sz[N];

ll ans,xs,t[N],an[N],su[N];
ll sum(ll x){
    return x*(x+1)/2;
}
void ins(int x,int de){
    ans+=de*(t[x]*sz[x]-su[x]);
    xs+=de*sum(sz[x]-1);
}
bool cmp(int x,int y){
    return d[x]<d[y];
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin >> n >> m;
    For(i,1,n)cin>>t[i];
    priority_queue<PI,vector<PI>,greater<PI> > heap;
    For(i,1,n){
        heap.push(mp(t[i]-t[i-1],i));
    }
    For(i,0,n){L[i]=R[i]=i; sz[i]=1; su[i]=t[i];}
    For(i,1,m)cin>>d[q[i]=i];
    sort(q+1,q+m+1,cmp);
    ans=0,xs=0;
    For(i,1,m){
        int x=q[i];
        while(!heap.empty()&&heap.top().fi<=d[x]){
            int p=heap.top().se;
            heap.pop();
            if(R[p]!=-1){
                ins(p,-1); ins(L[p-1],-1);
                R[L[p-1]]=R[p];
                L[R[p]]=L[p-1];
                sz[L[p-1]]+=sz[p];
                su[L[p-1]]+=su[p];
                L[p]=R[p]=-1;
                p=L[p-1];
                ins(p,1);
                ll tmp=(t[R[p]+1]-t[p])/sz[p]+1;
                if(R[p]<n)heap.push(mp(tmp,R[p]+1));
            }
        }
        an[x]=ans+xs*d[x];
    }
    For(i,1,m)cout<<an[i]<<"\n";
    return 0;
}