// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

// F(N) = N (N <= K)
// F(N) = F(N - ceil(N / K)) 

fn calc(n: usize, k: usize) -> usize {
    if n == 0 {
        return 0;
    }
    let sub = n / k + 1;
    let p = calc(n - sub, k);
    let add = 1 + p / (k - 1);
    p + add
}

fn run() {
    input! {
        k: usize,
        q: usize,
        ask: [usize; q],
    }
    let mut ask = ask.into_iter().enumerate().collect::<Vec<_>>();
    ask.sort_by_key(|p| p.1);
    let mut now = 0usize;
    for ask in ask.iter_mut() {
        ask.1 -= 1;
        while now + 1 + now / (k - 1) <= ask.1 {
            now += 1 + now / (k - 1);
        }
        ask.1 = now + 1;
    }
    ask.sort();
    for a in ask {
        println!("{}", a.1);
    }
}

fn main() {
    run();
}