#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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;}
//-------------------------------------------------------


int K,Q;
ll N;

ll pat[10000000];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>K>>Q;
	
	pat[0]=0;
	pat[1]=1;
	for(i=2;i<=1000000;i++) {
		if(pat[i-1]>=1LL<<60) {
			pat[i]=pat[i-1]+1;
		}
		else {
			ll p=2LL<<60;
			for(j=60;j>=0;j--) {
				ll tmp=p-(1LL<<j);
				ll tmp2=tmp-(tmp+K-1)/K;
				if(tmp2>=pat[i-1]) p=tmp;
			}
			pat[i]=p;
		}
	}
	
	
	while(Q--) {
		cin>>N;
		x=(lower_bound(pat,pat+1000000,N+1)-pat);
		cout<<pat[x-1]<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}