def General_Binary_Increase_Search_Integer(L,R,cond,default=None):
    """条件式が単調増加であるとき, 整数上で二部探索を行う.
    L: 解の下限
    R: 解の上限
    cond: 条件(1変数関数, 広義単調増加を満たす)
    default: Lで条件を満たさないときの返り値
    """
    if not(cond(R)): return default

    if cond(L): return L

    R+=1
    while R-L>1:
        C=L+(R-L)//2
        if cond(C): R=C
        else: L=C
    return R
#==================================================
def count(K,M):
    X=0
    while M>1:
        R=(M+(K-1))//K
        S=(K+M+R-K*R-1)//R

        X+=S
        M-=R*S

        if M==0:
            M+=1
            X-=1
    return X
#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

K,Q=map(int,input().split())

Ans=[]
for _ in range(Q):
    N=int(input())
    alpha=count(K,N)

    Ans.append(General_Binary_Increase_Search_Integer(1,N,lambda m:count(K,m)>=alpha))

write("\n".join(map(str,Ans)))