def compute_p(j, K): q = (j - 1) // (K - 1) r = (j - 1) % (K - 1) return q * K + (r + 2) def main(): import sys 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 if N == 1: print(1) continue M_list = [] M = N while M > 1: M_list.append(M) s = (M - 1) // K + 1 M = M - s M_list.append(1) j = 1 for i in reversed(range(len(M_list) - 1)): j = compute_p(j, K) print(j) if __name__ == "__main__": main()