# include <bits/stdc++.h>
# define ll long long
# define ld long double
# define pii pair<int, int>
# define fi first
# define se second
using namespace std;

int par[100002], mul[100002];

int find(int a) {
	if(a == par[a]) return a;
	par[a] = find(par[a]);
	return par[a];
}

int main() {
	int N, K;
	scanf("%d %d", &N, &K);
	vector<pii> arr(N);
	for(int i=0;i<N;i++) {
		scanf("%d", &arr[i].fi);
		arr[i].se = i;
	}
	sort(arr.begin(), arr.end());
	
	for(int i=0;i<K;i++) {
		int x;
		scanf("%d", &x);
		for(int k=0;k<N;k++) {
			if(k >= x - 1) {
				par[k] = k;
				if((k - x + 1)&1) mul[k] = -1;
				else mul[k] = 1;
			} else par[k] = x - 1;
		}
		ll ans = 0ll;
		for(int d=arr.size()-1;d>=0;d--) {
			int v = find(arr[d].se);
			ans += mul[v] * arr[d].fi;
			if(v == N - 1) mul[v] *= -1;
			else par[v] = v + 1;
		}
		printf("%lld\n", ans);
	}
	
}