#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    /*
    int N, K; cin >> N >> K;

    vector<bool> used(N+1, false);
    int R = N+1;
    while(R){
        int t = 0;
        rep2(i, 0, N){
            if(used[i]) continue;
            if(t++%K == 0){
                used[i] = true;
                R--;
            }
            cout << i << ' ';
        }
        cout << '\n';
    }
    */

    int K, Q; cin >> K >> Q;

    vector<ll> v = {0, 1};
    int M = 2;

    while(v.back() <= INF){
        ll d = v[M-1]-v[M-2];
        ll pre = v[M-1], now = pre;
        while(d > 0){
            pre = now, now += d;
            d = now/K-pre/K;
        }
        v.eb(now), M++;
    }

    //rep(i, 10) cout << v[i] << ' '; cout << '\n';

    while(Q--){
        ll N; cin >> N;
        auto it = lower_bound(all(v), N);
        cout << 1+*--it << '\n';
    }
}