/** * author: otera **/ #include using namespace std; // #define int long long using ll = long long; using ld = long double; using ull = unsigned long long; using int128_t = __int128_t; #define repa(i, n) for(int i = 0; i < n; ++ i) #define repb(i, a, b) for(int i = a; i < b; ++ i) #define repc(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define overload3(a, b, c, d, ...) d #define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__) #define rep1a(i, n) for(int i = 0; i <= n; ++ i) #define rep1b(i, a, b) for(int i = a; i <= b; ++ i) #define rep1c(i, a, b, c) for(int i = a; i <= b; i += c) #define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__) #define rev_repa(i, n) for(int i=n-1;i>=0;i--) #define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--) #define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__) #define rev_rep1a(i, n) for(int i=n;i>=1;i--) #define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--) #define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__) typedef pair P; typedef pair LP; #define pb push_back #define pf push_front #define ppb pop_back #define ppf pop_front #define eb emplace_back #define fr first #define sc second #define all(c) c.begin(),c.end() #define rall(c) c.rbegin(), c.rend() #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define si(c) (int)(c).size() inline ll popcnt(ull a){ return __builtin_popcountll(a); } #define kth_bit(x, k) ((x>>k)&1) #define unless(A) if(!(A)) ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vectorname(__VA_ARGS__) #define VEC(type,name,size) vectorname(size);in(name) #define vv(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define VV(type,name,h,w) vector>name(h,vector(w));in(name) #define vvv(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; template using umap = unordered_map; template void scan(T& a){ cin >> a; } template void scan(vector& a){ for(auto&& i : a) scan(i); } void in(){} template void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ cout << ' '; } template void print(const T& a){ cout << a; } template void print(const vector& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } } int out(){ cout << '\n'; return 0; } template int out(const T& t){ print(t); cout << '\n'; return 0; } template int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0,a1,a2,a3,a4,x,...) x #define debug_1(x1) cout<<#x1<<": "< dp(n + 1, vc(l + 1, 0)); vvc sum(n + 1, vc(l + 2, 0)); dp[0][0] = 1; for(int j = 0; j <= l; ++ j) { sum[0][j + 1] = sum[0][j] + dp[0][j]; } rep(i, n) { int need = l; rep(j, n) { if(j < n - 1 - i) need -= c[j]; } debug(i, need); for(int j = 0; j <= l; ++ j) { debug(i, j, dp[i][j]); dp[i + 1][j] = sum[i][j + 1] - sum[i][max(0, j - c[n - 1 - i])]; // if(j < need) dp[i + 1][j] = 0; sum[i + 1][j + 1] = sum[i + 1][j] + dp[i + 1][j]; } } INT(q); rep(_, q) { LL(k); if(dp[n][l] < k) { out(-1); continue; } vc ans(n, 0); int res = l; rep(i, n - 1) { int ok = c[i], ng = -1; while(abs(ng - ok) > 1) { int mid = (ok + ng) / 2; if(sum[n - 1 - i][res - mid] - sum[n - 1 - i][max(0, res - c[i])] < k) ok = mid; else ng = mid; } k -= (sum[n - 1 - i][res - ok] - sum[n - 1 - i][max(0, res - c[i])]); res -= ok; ans[i] = ok; } ans[n - 1] = res; out(ans); } } signed main() { int testcase = 1; // in(testcase); while(testcase--) solve(); return 0; }