import sys

def solve():

    data = sys.stdin.read().split()
    n = int(data[0])
    k = int(data[1])

    # used = [False] * (n + 1)
    sol = []
    out = []

    def back(start: int):

        if len(sol) == k:
            out.append(' '.join(map(str, sol)))
            return
        
        for value in range(start, n+1):
            sol.append(value)
            back(value + 1)
            sol.pop()
    

    back(1)
    sys.stdout.write('\n'.join(out) + '\n')

if __name__ == "__main__":
    solve()