rt

#include <iostream>
#include <bitset>
using namespace std;

int n, q;
bitset<(int)1e8 + 10> isprime; 
int prime[(int)1e8 + 10], top;

int main() {
	scanf("%d%d", &n, &q);
	for (int i = 2; i <= n; i ++) {
		if (!isprime[i]) {
			prime[top ++] = i;
		}
		for (int j = 0; j < top; j ++) {
			isprime[i * prime[j]] = 1;
			if (i % prime[j] == 0) break; 
		}
	}
	while (q --) {
		int x;
		scanf("%d", &x);
		printf("%d\n", prime[x - 1]);
	}
	return 0;
}