#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
long long s;
int n,m;
int a[N*2],k;
int main(){
    freopen("noi_online2020_ring.in","r",stdin);
    freopen("noi_online2020_ring.out","w",stdout);
    cin>>n>>m;
    for(int i = 1;i <= n;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    for(int i = 1;i <= m;i++){
        s = 0;
        cin>>k;
        if(k == 0){
            for(int j = 1;j <= n;j++){
                s += a[j] * a[j];
            }
        }
        else if(k == 1){
            s = a[n] * a[n-1] + a[1] * a[2];
            for(int j = n;j >= 3;j--){
                s += a[j] * a[j-2];
            }
        }
        else if(k == 2){
            if(n % 2 == 0){
                int l = n / k;
                for(int j = n;j >= 1;j-=l){
                    for(int o = j;o >= j-l+2;o--){
                        s += a[o] * a[o-1];
                    } 
                    s += a[j] * a[j-l+1];
                }
            }
            else{
                for(int j = n;j >= 3;j--){
                    s += a[j] * a[j-2];
                }
                s += a[n] * a[n-1];
            }
        }
        cout<<s<<endl;
    }
    
    return 0;
}