#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

const pid_t pid = getpid();
// Problem Specific Parameter:


const int inf =  1 << 21;
const int limit = 100010;
int ary[limit];
bool reset[limit];


int main(void){
	int n, m;
	cin >> n >> m;
	
	rep(i,m){
		int p;
		cin >> p;
		reset[p - 1] = true;
	}

	int val = inf;
	
	rep(i, n) {
		if(reset[i]) val = 1;
		ary[i] = val;
		val++; 
	}

	sort(ary, ary + n);

	int q;
	cin >> q;
	rep(loop, q){
		int l;
		cin >> l;

		int ng = 0, ok = 2 * inf;
		while(ok - ng > 1){
			const int mid = (ok + ng) / 2;
			const int val = n - (upper_bound(ary, ary + n, mid) - ary);
			if(val <= l) 
				ok = mid;
			else 
				ng = mid;
		}

		if(n < ok)
			cout << -1 << endl;
		else 
			cout << ok << endl;
	}

	return 0;
}
