#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, l; cin >> n >> l;
  vector<int> c(n); REP(i, n) cin >> c[i];
  vector dp(n + 1, vector(l + 1, 0LL));
  ranges::fill(dp[n], 1);
  for (int i = n - 1; i >= 0; --i) {
    dp[i][0] = 1;
    FOR(j, 1, l + 1) dp[i][j] = dp[i][j - 1] + dp[i + 1][j] - (j <= c[i] ? 0 : dp[i + 1][j - c[i] - 1]);
  }
  // REP(i, n + 1) FOR(j, 1, l + 1) cout << dp[i][j] - dp[i][j - 1] << " \n"[j == l];
  int q; cin >> q;
  while (q--) {
    ll k; cin >> k;
    if (k > dp[0][l] - dp[0][l - 1]) {
      cout << "-1\n";
      continue;
    }
    int used = 0;
    vector<int> ans(n, 0);
    REP(i, n) {
      const int num = min(c[i], l - used);
      int lb = -1;
      ans[i] = num;
      while (ans[i] - lb > 1) {
        const int mid = midpoint(lb, ans[i]);
        (dp[i + 1][l - (used + mid) - 1] - (used + num == l ? 0 : dp[i + 1][l - (used + num) - 1]) < k ? ans[i] : lb) = mid;
      }
      if (ans[i] < num) k -= dp[i + 1][l - (used + ans[i]) - 1] - (used + num == l ? 0 : dp[i + 1][l - (used + num) - 1]);
      used += ans[i];
    }
    REP(i, n) cout << ans[i] << " \n"[i + 1 == n];
  }
  return 0;
}