def c(n,m):
    
    sum, ss = 1, 1
    for i in range(2,n+1,1):
        
        sum *= i
        
        if(i <= m):
            if(sum % i == 0): sum /= i;
            else: ss *= i

        else:
            if(sum % (i-m) == 0): sum //= i-m
            else: ss *= (i-m)


        if(sum % ss == 0):
            sum //= ss;
            ss = 1

    return int(sum // ss);


def search(n,i):
    
    l, r = int(i), int(n+i+1)

    while(r-l > 1):
        mid = (r+l) // 2
        if(c(mid,i) <= int(n)): l = mid
        else: r = mid

    return l


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()