def isPrime(n):
    is_prime = [True]*(n+1)
    primes = []
    for i in range(2,n+1):
        if is_prime[i]:
            primes.append(i)
        for p in primes:
            if i*p>n:
                break
            is_prime[i*p]=False
            if i%p==0:
                break
    return primes

n,x = map(int,input().split())
ans = isPrime(n)
for _ in range(x):
    print(ans[int(input())-1])