#include<bits/stdc++.h>
using namespace std;
const int N=1e8+5;
int is_prime[N],prime[N],tot=0;
void oulashai(int n)
{
	memset(is_prime,-1,sizeof(is_prime));
	is_prime[1]=is_prime[0]=0;
	for(int i=2;i<=n;i++){
		if(is_prime[i])
			prime[++tot]=i;
		for(int j=1;j<=tot&&prime[i]*i<=n;j++){
			is_prime[prime[j]*i]=0;
			if(i%prime[j]==0)
				break;
		}		
	}
}
int main(){
	freopen("P3383_1.in","r",stdin); 
	int n,q;
	cin>>n>>q;
	oulashai(n);
	for(int i=1;i<=q;i++){
		int x;
		cin>>x;
		cout<<prime[x]<<endl;	
	}
}