// UUID: 372ee24c-9f6e-40a4-9685-ded56269d9de
#include <iostream>

using namespace std;

const int MAX_N = 1e5;
int a[MAX_N];

int f[1 + MAX_N];

int main() {
    int n, k;
    cin >> n >> k;
    for ( int i = 0; i < n; i ++ )
        cin >> a[i];
        
    for ( ; k > 0; k -- ) {
        int p;
        cin >> p;
        for ( int i = 1; i <= n; i ++ )
            f[i] = 0;
        for ( int i = 0; i < p; i ++ )
            f[a[i]] ++;
            
        int mx = n, pocket = 0, player = 1;
        long long score = 0;
        for ( int i = p; i < n; i ++, player *= -1 ) {
            if ( pocket ) {
                score += pocket * player;
                pocket = 0;
            } else {
                while ( !f[mx] )
                    mx --;
                f[mx] --;
                score += mx * player;
            }
            if ( a[i] <= mx )
                f[a[i]] ++;
            else
                pocket = a[i];
        }
        
        for ( int i = 0; i < p; i ++, player *= -1 ) {
            if ( pocket ) {
                score += pocket * player;
                pocket = 0;
            } else {
                while ( !f[mx] )
                    mx --;
                f[mx] --;
                score += mx * player;
            }
        }
        cout << score << '\n';
    }
    return 0;
}