#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,q; cin >> n >> q;
    vector<ll> a(n+1);
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    vector<ll> dp(n*n+1,2e18);
    for(int i=1;i<=n;i++){
        dp[i]=a[i];
    }
    for(int i=n+1;i<=n*n;i++){
        for(int j=1;j<=n;j++){
            dp[i]=min(dp[i],dp[i-j]+dp[j]);
        }
    }
    vector<pair<ll,ll>> v(n);
    for(int i=0;i<n;i++){
        v[i]={a[i+1],i+1};
    }
    sort(v.begin(), v.end(),[&](auto i,auto j){
        return i.first*j.second < i.second *j.first;
    });
    while(q--){
        int x; cin >> x;
        if(x<=n*n){
            printf("%lld\n", dp[x]);
        }
        else{
            ll m=(x-n*n+v[0].second-1)/v[0].second;
            printf("%lld\n",dp[x-m*v[0].second]+v[0].first*m);
        }
    }
}