from bisect import bisect_right
k, q = map(int, input().split())
a = [1]
while a[-1] < 1000000000000000000:
    a.append((a[-1] * k - 1) // (k - 1) + 1)
for _ in range(q):
    n = int(input())
    print(a[bisect_right(a, n) - 1])