#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
template <class T>
void chmin(T &a, const T &b) {
    if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
    if (a < b) a = b;
}

void solve() {
    ll K;
    int Q;
    cin >> K >> Q;
    vector<ll> X(Q);
    rep(q, Q) cin >> X[q];

    map<ll, ll> m_dp;

    auto rec = [&](auto &&rec, ll n) -> ll {
        if (n <= K) return n;
        if (m_dp.count(n)) return m_dp[n];

        ll removed = 1 + (n - 1) / K;
        ll val = rec(rec, n - removed);

        ll res = val + 1 + (val - 1) / (K - 1);

        return m_dp[n] = res;
    };

    for (auto N : X) {
        ll ans = rec(rec, N);
        cout << ans << "\n";
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}