You are given a string S. Your task is to print all possible combinations, up to size k, of the string in lexicographic sorted order.

[1,1,1,1,1,1,1,1,1,1,2] (10 1's and 1 2), using itertools permutations, my computer ran at high speed for over a minute before I stopped it, because there should only be 11 permutations, one for each ...