#include <bits/stdc++.h>
using namespace std;
int main(){
  int K, Q;
  cin >> K >> Q;
  vector<long long> A;
  A.push_back(1);
  while (true){
    long long nxt = A.back() + (A.back() + K - 2) / (K - 1);
    A.push_back(nxt);
    if (nxt > 2000000000000000000){
      break;
    }
  }
  for (int i = 0; i < Q; i++){
    long long N;
    cin >> N;
    auto itr = upper_bound(A.begin(), A.end(), N);
    itr--;
    cout << *itr << endl;
  }
}