#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int K,T;
long N;
vector<long>A;
main()
{
	cin>>K>>T;
	A.push_back(0);
	while(true)
	{
		long pre=A.back()+1;
		long now=pre;
		while(now-now/K<pre)now=pre+now/K;
		A.push_back(now);
		if(now>=(long)1e18)break;
	}
	for(;T--;)
	{
		cin>>N;
		auto it=lower_bound(A.begin(),A.end(),N);
		cout<<*--it+1<<endl;
	}
}