#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } long long op(long long a, long long b) { return a + b; } long long e() { return 0; } long long target; bool f(long long v) { return v < target; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, l; cin >> n >> l; vectorc(n); rep(i, n)cin >> c[i]; vector>seg; rep(i, n) { segtree_seg(l + 1); seg.push_back(_seg); } rrep(i, n - 1) { rep(j, l + 1) { int mn = max(0, j - c[i]); int mx = j; auto get = seg[i + 1].prod(mn, mx + 1); seg[i].set(j, get); } } rep(i, c[n - 1] + 1) seg[n - 1].set(i, 1); int q; cin >> q; const long long mx = seg[0].get(l); while (q--) { long long k; cin >> k; if (mx < k) { cout << -1 << endl; continue; } vectorans(n); int sz = l; rep(i, n - 1) { int mn = max(0, sz - c[i]); target = k; int idx = seg[i + 1].max_right(mn); k -= seg[i + 1].prod(mn, idx); ans[i] = sz - idx; sz = idx; } ans[n - 1] = sz; rep(i, n)cout << ans[i] << " "; cout << endl; } return 0; }