#include<bits/stdc++.h>
using namespace std;

int n, m = 1;
bool shu[100000010];
int prime[100000000];
void pdprime(){
	for (int i = 2; i <= n; i++){
		if (shu[i] == 0){
			for (int j = i; i*j <= n; j++){
				shu[i*j] = 1;
			}
			prime[m] = i;
			m++;
		}
	}
}
int main(){
	int q;
	scanf("%d%d", &n, &q);
	pdprime();
	while (q--){
		int k;
		scanf("%d", &k);
		printf("%d\n", prime[k]);
	}
	return 0;
}