Determine all possible pairs (M, X) of positive integers with M-1 > X > 1, such that the duodecimal representation of comb(M, X) consists of non leading zeroes, and contains each of the digits from 0 to B exactly once.

Note: comb(M, X) is the number of X-element subsets (the X combinations) of an X-element set, that is the number of ways that X things can be chosen from a set of M things.