#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int n, k;
cin>>n>>k;
int a[n];
for(int i=0; i<n; i++)
    cin>>a[i];
int b[k];
for(int i=0; i<k; i++)
    cin>>b[i];
vector<int> arr;
for(int i=0; i<k; i++){
    for(int j=0; j<b[i]-1; j++){
        arr.push_back(a[j]);
    }
    int first=0, second=0;
    int l=0, d=0;
    while(d+b[i]!=n+1){
        arr.push_back(a[d+b[i]-1]);
        sort(arr.begin(), arr.end());
        if(l%2==0)
            first+=arr[arr.size()-1];
        else
            second+=arr[arr.size()-1];
        l++;
        d++;
        arr.pop_back();
    }
    while(!arr.empty()){
        sort(arr.begin(), arr.end());
        if(l%2==0)
            first+=arr[arr.size()-1];
        else
            second+=arr[arr.size()-1];
        l++;
        arr.pop_back();
    }
    cout<<first-second<<endl;
}
return 0;
}