import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 31)
# inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

k,q=LI()
nqi=[]
for qi in range(q):
    n=II()
    nqi.append((n,qi))

nqi.sort(key=lambda x:-x[0])

def d_cnt(p):
    d1=p//(k-1)+1
    return d1,((k-1)*d1-p+d1-1)//d1

ans=[0]*q
p,s=0,1
while nqi:
    d1,c=d_cnt(p)
    d2,c2=d_cnt(s)
    if c2<c:c=c2
    while nqi and nqi[-1][0]<=s+c*d2:
        n,qi=nqi.pop()
        ans[qi]=p+(n-s+d2-1)//d2*d1+1
    p+=d1*c
    s+=d2*c

print(*ans,sep="\n")