#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int k, q; cin >> k >> q;
  vector<pair<ll, int>> query(q);
  REP(i, q) {
    cin >> query[i].first; --query[i].first;
    query[i].second = i;
  }
  sort(ALL(query));
  vector<ll> ans(q, -1);
  int idx = 0;
  __int128 card = 0;
  while (idx < q) {
    __int128 nx = (card * k + k - 2) / (k - 1);
    if (nx % k == 0) ++nx;
    while (idx < q && card <= query[idx].first && query[idx].first < nx) {
      ans[query[idx++].second] = static_cast<ll>(card);
    }
    card = nx;
  }
  REP(i, q) cout << ans[i] + 1 << '\n';
  return 0;

  // vector<int> card(n);
  // iota(ALL(card), 0);
  // while (card.size() > 1) {
  //   vector<int> nx;
  //   REP(i, card.size()) {
  //     if (i % k > 0) nx.emplace_back(card[i]);
  //   }
  //   card.swap(nx);
  // }
  // cout << card.front() << '\n';
}