The number of integers greater than 6,000 that can be formed, using the digits 3, 5, 6, 7 and 8, without repetition, is
If the total number of non-decreasing functions defined from $f : \{1,2,3,4,5\} \to \{1,2,3,4,5,6,7,8,9\}$ is $m$ then $\frac{m}{143}$ is equal to ______.
The set \(S = \{1, 2, 3, \ldots, 12\}\) is to be partitioned into three sets \(A\), \(B\), \(C\) of equal size. Thus, \(A \cup B \cup C = S\), \(A \cap B = B \cap C = A \cap C = \phi\). The number of ways to partition \(S\) is