#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

vector<int> as_base(int n, int k){
    vector<int> ans;
    while(n != 0) {
        ans.push_back(n%k);
        n /= k;
    }
    return ans;
}

// calc a//b 
template<typename T>
T ceil_div(T a, T b){
    return (a+b-1)/b;
}

const ll N_MAX = 1e18;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int k, q; cin >> k >> q;
    auto f = [&](ll x){
        return x-(x/k+1);
    };
    auto nx = [&](ll x) -> ll{
        if(x%(k-1) == 0){
            return x+(x/(k-1))+1;
        }else{
            return x+(ceil_div<ll>(x, k-1));
        }
    };
    vector<ll> x;
    x.push_back(0);
    while(true){
        ll y = nx(x.back());
        x.push_back(y);
        if(y > N_MAX) break;
    }
    // print_vector(x);
    while(q--){
        ll n; cin >> n; n--;
        auto p = upper_bound(x.begin(), x.end(), n);
        p--;
        cout << (*p)+1 << endl;  
    }
}