def c(n,m):
    N,M,N_M = 1,1,1
    for i in range(1,n+1):
        N *= i
        if(i <= m) : M *= i
        else : N_M *= (i-m)
    return N // (M * N_M)

def search(n,i):
    for j in range(i,n**2,1):
        if(c(j,i) > n) : return j-1
    return 0


n,I = map(int,input().split())
for i in range(I,0,-1):
    s = search(n,i)
    print(s,end=' ')
    n -= c(s,i)
    if(n == 0) : break
print()