#include <iostream>
using namespace std;
void work(int &n,int* &prime,int* &isprime,int &cnt) {
	isprime[1] = 1;
	for (int i = 2; i < n; i++) {
		if(!(isprime[i]))
		prime[++cnt] = i;
		for (int j = 1; j <= cnt && i * prime[j] <= n; j++) {
			isprime[i * prime[j]] = 1;
			if (!(i % prime[j]))
				break;
		}
	}
}
int main() {
	int len, n;
	cin >> len >> n;
	int* isprime=new int[len+1];
	memset(isprime, 0, len+1);
	int* prime=new int[len+1], cnt = 0;
	work(len,prime,isprime,cnt);
	for (int i = 1;  i<= n; i++) {
		int val;
		cin >> val;
		cout << prime[val]<<'\n';
	}
}