#include <bits/stdc++.h>
constexpr int DEBUG = 0;
using namespace std;
using int64 = long long;

template<typename T>
vector<vector<T>> Make2D(int d1, int d2, T default_value) {
  return vector<vector<T>>(d1, vector<T>(d2, default_value));
}

template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
  s << "[";
  for (int i = 0; i < int(v.size()); i++) {
    if (i > 0) { s << ", "; } s << v[i];
  }
  s << "]";
  return s;
}

constexpr int64 INF = 2E18;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n, l; cin >> n >> l;
  vector<int> cs(n);
  for (int i = 0; i < n; i++) {
    cin >> cs[i];
  }

  auto count_table = Make2D<int64>(n, l + 1, 0);
  auto c_sum_table = Make2D<int64>(n, l + 1 + 1, 0);

  for (int j = 0; j <= cs[n - 1]; j++) {
    count_table[n - 1][j] = 1;
  }
  for (int j = 0; j <= l; j++) {
    c_sum_table[n - 1][j + 1] = c_sum_table[n - 1][j] + count_table[n - 1][j];
  }

  for (int i = n - 2; i >= 0; i--) {
    for (int j = 0; j <= l; j++) {
      int k = min(j, cs[i]);
      count_table[i][j] = c_sum_table[i + 1][j + 1] - c_sum_table[i + 1][j - k];
    }
    for (int j = 0; j <= l; j++) {
      c_sum_table[i][j + 1] = c_sum_table[i][j] + count_table[i][j];
    }
  }
  if (DEBUG) cerr << count_table << endl;

  int q_count; cin >> q_count;
  for (int q_index = 0; q_index < q_count; q_index++) {
    if (DEBUG) cerr << "q_index: " << q_index << endl;
    int64 q; cin >> q; q--;
    if (q >= count_table[0][l]) {
      cout << -1 << endl;
      continue;
    }

    int r = l;
    for (int i = 0; i < n - 1; i++) {
      if (DEBUG) cerr << "q: " << q << endl;
      if (DEBUG) cerr << "r: " << r << endl;
      int delta = 1 << 17;
      int j_min = max(r - cs[i], 0);
      int j = j_min;
      while (delta > 0) {
        int j_new = j + delta;
        if ((r - j_new) >= 0 && (r - j_new) <= min(r, cs[i]) &&
            q >= c_sum_table[i + 1][j_new] - c_sum_table[i + 1][j_min]) {
          j = j_new;
        }
        delta /= 2;
      }
      if (!DEBUG) cout << (r - j) << " ";
      if (DEBUG) cerr << (r - j) << endl;
      q -= c_sum_table[i + 1][j] - c_sum_table[i + 1][j_min];
      r = j;

      // b = 0;
      // for (int j = min(r, cs[i]); j >= 0; j--) {
      //   if (q < b + count_table[i + 1][r - j]) {
      //     cout << j << " ";
      //     r -= j;
      //     q -= b;
      //     b = 0;
      //     break;;
      //   } else {
      //     b += count_table[i + 1][r - j];
      //   }
      // }
    }
    if (!DEBUG) cout << r << endl;
  }
}