def prime_check(n):
    nums = [True] * (n + 1)
    prime = []
    for i in range(2, n + 1):
        if nums[i]:
            prime.append(i)
        j = 0
        while prime[j] <= n // i:
            nums[prime[j] * i] = False
            if i % prime[j] == 0:
                break
            j += 1
    return prime

n, t = [int(i) for i in input().split()]
prime = prime_check(n)
while t:
    a = int(input())
    print(prime[a - 1])
    t -= 1