import sys

def find_last_card(K, N):
    current_size = N
    pos = 1
    while current_size > 1:
        # Compute the next size after one step
        s = current_size - 1
        m = s - (s // K)
        # Compute the new position based on pos
        a = (pos - 1) // (K - 1)
        b = (pos - 1) % (K - 1) + 1
        new_pos = a * K + b + 1
        # Update current_size and pos
        current_size = m
        pos = new_pos
    return pos

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

if __name__ == "__main__":
    main()