#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
vector<int> solve(int n,int k){
    vector<int> v(n);
    int i,j = 0;
    while(true){
        j++;
        vector<int> u;
        for(i=0;i<n;i++){
            if(!v[i]) u.push_back(i);
        }
        if(u.size()==0) break;
        for(i=0;i<u.size();i+=k){
            v[u[i]] = j;
        }
    }
    return v;
}

typedef long long ll;
ll inf = 1000000000000000000;
int main(){
    /*int i,n; cin >> n;
    for(i=1;i<=n;i++){
        vector<int> v = solve(i,4);
        //cout << "num = " << i << ", ";
        int mx = -1,ret = -1;
        for(int j=0;j<v.size();j++){
            if(mx<v[j]){
                mx = max(mx,v[j]); ret = j;
            }
        }
        cout << (ret + 1) << " ";
        /*for(int x:v) cout << x << " ";
        cout << endl;
    }*/
    int i,k,q; cin >> k >> q;
    vector<ll> v;
    v.push_back(1);
    while(v.back()<inf){
        //cout << v.size() << " " << v.back() << endl;
        ll x = v.back();
        ll p = (x + (k - 2))/(k - 1);
        v.push_back(x + p);
    }
    //cout << v.size() << endl;
    for(i=0;i<q;i++){
        ll n; cin >> n;
        auto it = upper_bound(v.begin(),v.end(),n);
        it--;
        cout << (*it) << endl;
    }
}