#include<bits/stdc++.h>
using namespace std;
const int N=2e5+1;
int n,m,a[N],ans1=0,ans2=0,t=0,b[N],ans[N];
int gcd(int x,int y)
{
    if(x%y==0)return y;
    else return gcd(y,x%y);
}
int cmp(int a,int b)
{
    return a>b;
}
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];
        ans1+=a[i]*a[i];
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n-2;i++)
    {
        ans2+=a[i]*a[i+2];
    }
    ans2+=a[1]*a[2];
    ans2+=a[n]*a[n-1];
    for(int i=1;i<=m;i++)
    {
        int k;
        cin>>k;
        if(k==0||n==k)cout<<ans1<<endl;
        else if(gcd(n,k)==1)cout<<ans2<<endl;
        else
        {
            int as=0;
            for(int j=1;j<=t;j++)
            {
                if(gcd(n,k)==b[j])cout<<ans[j]<<endl;
                as=1;
                break;
            }
            if(as==1)continue;
            int ans3=0,g=gcd(n,k);
            for(int j=n/g;j<=n;j+=j)
            {
                for(int l=j-n/g+1;l<=j-2;l++)
                {
                    ans3+=a[l]*a[l+2];
                }
                ans3+=a[j-n/g+1]*a[j-n/g+2];
                ans3+=a[j]*a[j-1];
            }
            cout<<ans3<<endl;
            t++;
            b[t]=gcd(n,k);
            ans[t]=ans3;
        }
    }
    return 0;
}