There are n elements in total which is already divided into m groups of k elements each. Thus, n=m*k.
The question is, how many arrangements of these m groups are possible?
I came to a possible solution of n!/m! but am not sure if that covers all permutations possible among each group (i.e, k! ways of arranging each group).
The original problem is as follows:
There exists an array of n distinct numbers. This array is divided into m sub-sequences of k elements each.
All elements of a subsequence are either greater than or less than all elements of another subsequence.
I have to find the number of possible permutations of the indices in the array which may appear in the sorted array.