#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int K, Q;

int main() {
  for (; ~scanf("%d%d", &K, &Q); ) {
    for (int q = 0; q < Q; ++q) {
      Int N;
      scanf("%lld", &N);
      
      assert(N <= 10'000'000 / Q);
      
      vector<int> as(N);
      iota(as.begin(), as.end(), 1);
      for (; as.size() > 1; ) {
        vector<int> bs;
        for (int i = 0; i < (int)as.size(); ++i) {
          if (i % K != 0) {
            bs.push_back(as[i]);
          }
        }
        as = bs;
      }
      printf("%d\n", as[0]);
    }
  }
  return 0;
}