#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}


template<typename T>
class Cumsum{
    public:
    Cumsum(vector<T> v): v(v){
        n = v.size();
        v_cumsum = vector<T>(n+1, T(0));
        for(int i = 0; i < n; i++) v_cumsum[i+1] = v_cumsum[i]+v[i];
    }
    /**
     * v[l] + ... + v[r-1]
     */ 
    T sum(int l, int r){
        if(r <= l) return T(0);
        if(r > n) r = n;
        if(l < 0) l = 0;
        return v_cumsum[r]-v_cumsum[l];
    }
    // private:
    int n;
    vector<T> v;
    vector<T> v_cumsum;
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, l; cin >> n >> l;
    vector<int> c(n);
    for(int i = 0; i < n; i++) cin >> c[i];
    auto dp = vec2d(n, l+1, 0ll);
    for(int len = 0; len <= c[n-1]; len++){
        dp[n-1][len] = 1;
    }
    int sum_len = c[n-1];
    for(int i = n-2; i >= 0; i--){
        auto cumsum = Cumsum<ll>(dp[i+1]);
        sum_len += c[i];
        for(int len = 0; len <= sum_len && len <= l; len++){
            int l = max(0, len-c[i]);
            int r = len+1;
            dp[i][len] = cumsum.sum(l, r);
        }
    }
    auto cumsum = vector<Cumsum<ll>>();
    for(int i = 0; i < n; i++) {
        cumsum.push_back(Cumsum<ll>(dp[i]));
    }
    int q; cin >> q;
    while(q--){
        ll k; cin >> k;
        if(k > dp[0][l]){
            cout << -1 << endl;
            continue;
        }
        ll rem_cnt = k;
        int rem_len = l;
        vector<int> ans;
        for(int i = 0; i < n-1; i++){
            int l = 0, r = min(c[i], rem_len);
            int min_rem_len = rem_len-c[i];
            if(cumsum[i+1].sum(min_rem_len, rem_len-r+1) >= rem_cnt){
                l = r;
            }else{
                while(r-l > 1){
                    int c = (l+r)/2;
                    if(cumsum[i+1].sum(min_rem_len, rem_len-c+1) >= rem_cnt) l = c;
                    else r = c;
                }
            }
            ans.push_back(l);
            rem_cnt -= cumsum[i+1].sum(min_rem_len, rem_len-l);
            rem_len -= l;
        }
        ans.push_back(rem_len);
        print_vector(ans);
    }
    // print_vector(dp[1]);
    // print_vector(dp[2]);
    // debug_value(cumsum[1].sum(0, 3))
}