import sys

def compute_f(n, K):
    stack = []
    current = n
    while current != 1:
        r = (current + K - 1) // K
        stack.append(current)
        current = current - r
    result = 1
    for m in reversed(stack):
        q = (result - 1) // (K - 1)
        result = result + q + 1
    return result

def main():
    input = sys.stdin.read().split()
    ptr = 0
    K = int(input[ptr])
    ptr += 1
    Q = int(input[ptr])
    ptr += 1
    for _ in range(Q):
        N = int(input[ptr])
        ptr += 1
        print(compute_f(N, K))

if __name__ == "__main__":
    main()