#include <iostream>
#include <bitset>
using namespace std;
const int N = 5e6 + 10, M = 1e8 + 10;
int primes[N], cnt;
bitset<M> st;
void get_primes(int n)
{
    for(int i = 2; i <= n; i ++ )
    {
        if(!st[i]) primes[cnt ++ ] = i;
        for(int j = 0; primes[j] <= n / i; j ++ )
        {
            st[primes[j] * i] = 1;
            if(i % primes[j] == 0) break;
        }
    }
}
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    
    get_primes(n);
    
    while(m -- )
    {
        int x;
        scanf("%d", &x);
        printf("%d\n", primes[x - 1]);
    }
    return 0;
}