#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (x == 0) return y;
  return gcd(y % x, x);
}
long long powmod(long long x, long long y, long long m) {
  if (y == 0) return 1;
  long long p = powmod(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
long long modif(long long x, long long m) { return (powmod(x, m - 2, m)); }
bool fa(vector<long long> &x, vector<long long> &y) {
  return x[1] - x[0] < y[1] - y[0];
}
bool fs(vector<long long> x, vector<long long> y) {
  return x.size() > y.size();
}
bool f1(pair<long long, long long> &x, pair<long long, long long> &y) {
  return x.first < y.first;
}
bool f2(pair<long long, long long> &x, pair<long long, long long> &y) {
  return x.first > y.first;
}
bool f3(long long &x, long long &y) { return x > y; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, q;
  cin >> n >> q;
  while (q--) {
    long long x;
    cin >> x;
    while (x % 2 == 0) {
      long long y = x / 2ll;
      y = n - y;
      x += y;
    }
    long long ans = x + 1;
    ans /= 2;
    cout << ans << "\n";
  }
  return 0;
}
