2 K-Permutation Lists

I need two K-Permutations lists generated, ListA and ListB, based on the following parameters: Set size: 30. Set element names: 10, 11, 12, 13, 14 ... 37, 38, 39 Arrangement size: for ListA the size is 3, for ListB, the size is 4. Arrangements are to be unique for each list produced. ListA should contain 24360 arrangements. ListB should contain 657720 arrangements. Sort order: for each list, the sorting should maximize the distribution of set elements, meaning that set Element 10 should not appear in the sorted arrangement list a second time until all other set elements have been utilized, AND the usage of any particular element should be uniformly used across the result set (meaning an element should appear once every n arrangements (approximately) in the sorted arrangement list). The sorted arrangement list must NOT be toploaded with excessive usages of Element 10 for example as compared to other elements.