from bisect import bisect_right
k, q = map(int, input().split())
a = [0] * (1000001)
a[0] = 1
for i in range(1000000):
    a[i + 1] = (a[i] * k - 1) // (k - 1) + 1
for _ in range(q):
    n = int(input())
    print(a[bisect_right(a, n) - 1])