# Arup Guha
# 6/28/2017
# Solution to 2017 SI@UCF Python with Recursion Test #2 Question 5

def main():
    testlist = [-1,-1,-1]
    printIncOdom(testlist, 0, 5)
    
def printIncOdom(mylist, k, numD):

    # We are done - print it.
    if k == len(mylist):
        print(mylist)
        return

    # Find the lowest item we can put in slot k.
    start = 0
    if k > 0:
        start = mylist[k-1]+1

    # Try each possible item in slot k.
    for i in range(start, numD):
        mylist[k] = i
        printIncOdom(mylist, k+1, numD)

main()