// UUID: 3780d355-acc1-42bb-9734-e5ecf64aa0b2
#include <bits/stdc++.h>

using namespace std;


typedef pair<int,int> ii;
typedef long long ll;

#define X first
#define Y second

const int MOD=1e9+7;

const int N=1e5+10;
const ll inf=1e16;



int n,m,a[N];

int h[N];

ll solve(){
    for(int i=1;i<=m;i++) h[a[i]]++;
    ll ans=0;
    h[0]=1;
    for(int i=1,j=n;i<n;i++){
        while (!h[j]) j--;
        if (i==1){
            h[j]--;
            ans=-j;
            while (!h[j]) j--;
        }
        int val=j;
        if (i+m<=n){
            if (a[i+m]>=val) val=a[i+m],h[j]++;
            else h[a[i+m]]++;
        }
        h[j]--;
        ans+=(i&1)?val:-val;
//        cout<<m<<" "<<i<<" "<<val<<'\n';
    }
//    assert(count(h+1,h+N,1)==0);
    return -ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int test;
    scanf("%d%d",&n,&test);
//    assert()
    for(int i=1;i<=n;i++){
        scanf("%d",a+i);
//        assert(a[i]<=n);
    }
    while (test--){
        scanf("%d",&m);
        printf("%lld\n",solve());
    }
}