#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,L;
	cin>>N>>L;
	auto comb=[](ll a,ll b)->ll{
		if(b<0) return 0;
		if(a<b) return 0;
		ll an=1;
		rep(i,b) an*=(a-i),an/=(i+1);
		return an;
	};
	vector<ll> p(N);
	rep(i,N) cin>>p[i];
	int Q;
	cin>>Q;
	if(N==1){
		rep(i,Q){
			ll k;
			cin>>k;
			if(k!=1) cout<<"-1\n";
			else{
				if(p[0]>=L) cout<<L<<"\n";
				else cout<<p[0]<<"\n";
			}
		}
		return ;
	}
	rep(i,Q){
		ll K;
		cin>>K;
		vector<int> ans(N);
		ll sum=0;
		rep(j,N-1){
			ll l=-1,r=p[j]+1;
			while(r-l>1){
				ll med=(l+r)/2;
				ll tmp=0;
				rep(k,1<<(N-j)){
					ll Z=L-sum;
					ll si=1;
					for(int x=j;x<N;x++){
						if(k&(1<<(x-j))){
							Z-=p[x]+1;
							si*=-1;
						}else{
							if(x==j) Z-=med;
						}
					}
					//cout<<k<<" "<<tmp<<"\n";
					tmp+=si*comb(Z+N-j-1,N-j-1);
				}
				//cout<<tmp<<" "<<med<<"#\n";
				if(tmp<K) r=med;
				else l=med;
			}
			//cout<<"# "<<k<<" , ";
			//cout<<l<<" "<<r<<" :\n";
			if(l==-1){
				ans[0]=-1;
				break;
			}
			ans[j]=l;
			sum+=l;
			rep(k,1<<(N-j)){
				ll Z=L-sum+l;
				ll si=1;
				for(int x=j;x<N;x++){
					if(k&(1<<(x-j))){
						Z-=p[x]+1;
						si*=-1;
					}else{
						if(x==j) Z-=r;
					}
				}
				K-=si*comb(Z+N-j-1,N-j-1);
			}
		}
		ans[N-1]=L-sum;
		if(ans[0]==-1) cout<<"-1\n";
		else vec_out(ans);
	}
}