import sys

def main():
    input = sys.stdin.read().split()
    idx = 0
    K = int(input[idx])
    idx += 1
    Q = int(input[idx])
    idx += 1
    queries = list(map(int, input[idx:idx+Q]))
    
    for N in queries:
        if N == 1:
            print(1)
            continue
        
        path = []
        current = N
        while True:
            path.append(current)
            if current == 1:
                break
            s = (current - 1) // K + 1
            current -= s
        
        path.reverse()
        ans = 1
        for n in path[1:]:
            ans += (ans - 1) // (K - 1) + 1
        
        print(ans)

if __name__ == '__main__':
    main()