#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long sum[400000];
long long INF = 1000000000000000007;
int main() {
	long long k, q;
	cin >> k >> q;
	sum[0] = 1;
	long long s = 1, i1 = 1;
	for (;;i1++) {
		if (s >= INF)break;
		s += (s + k - 2) / (k - 1);
		sum[i1] = s;
	}
	i1++;
	for (int i = 0; i < q; i++) {
		long long n;
		cin >> n;
		auto itr = upper_bound(sum, sum + i1, n);
		itr--;
		cout << *itr << endl;
	}
}