#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
int main(){
      ll k,q;
      cin>>k>>q;
      while(q--){
            ll n;
            cin>>n;
            ll cur=1;
            ll sum=0;
            while(n!=1){
                  ll v=(n-1)/k;
                  ll u=((n-1)/k)*k;
                  u=max(1ll,u);
                  ll d=(n-u+v)/(v+1);
                  n-=d*(v+1);
                  sum+=d;
            }
            while(sum>0){
                  ll v=(cur-1)/(k-1);
                  ll u=((cur-1)/(k-1)+1)*(k-1);
                  ll d=(u+1-cur+v)/(v+1);
                  d=min(sum,d);
                  cur+=d*(v+1);
                  sum-=d;
            }
            cout<<cur<<"\n";
      }
}