kdb/q: generate all possible “strings” of length N

Question

in KDB/Q, how do I generate all combinations given an alphabet universe (doesn\'t have to be string, could be like a list of numbers) for a given size n?

What I am lo