Is there a faster way to create this list of strictly increasing tuples?

Question

Given some natural number n, I\'m trying to create a list L such that L[i] is the list of all lists of length i, whose entries are in {1, 2, ..., n} and are strictly increasing.