#define _CRT_SECURE_NO_WARNINGS
#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include <map>
#include <fstream>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <assert.h>
#include <complex>
using namespace std;
#define LONG_INF 10000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353LL
#define seg_size 65536*4
#define REP(i,n) for(long long i = 0;i < n;++i)
long long cnt[300000] = {};
long long adding[300000] = {};
int main() {
#define int long long
	int n, m;
	cin >> n >> m;
	vector<long long> input;
	REP(i, m) {
		long long tmp;
		cin >> tmp;
		input.push_back(tmp);
	}
	input.push_back(n+1);
	sort(input.begin(), input.end());
	REP(i, input.size()-1) {
		cnt[input[i + 1] - input[i]-1]++;
	}
	long long tools = 0;
	for (int i = 200000; i >= 0; --i) {
		cnt[i] += cnt[i + 1];
		adding[i] += adding[i + 1];
		adding[i] += cnt[i];
	}
	int query;
	cin >> query;
	REP(test, query) {
		long long geko = 0;
		cin >> geko;
		geko -= input[0] - 1;
		if (geko < 0) {
			cout << -1 << endl;
			continue;
		}
		long long top = n-1;
		long long bot = 1;
		while (top - bot > 1) {
			long long mid = (top + bot) / 2;
			if (adding[mid] > geko) {
				bot = mid;
			}
			else {
				top = mid;
			}
		}
		for (int i = max(1LL, (long long)bot - 3);; ++i) {
			if (adding[i] <= geko) {
				cout << i << endl;
				break;
			}
		}
	}
	return 0;
}
