$A$ person has three different bags and four different books. The number of ways, in which he can put these books in the bags so that no bag is empty, is:

There are five students $S_1, S_2, S_3, S_4$ and $S_5$ in a music class and for them there are five seats $R_1, R_2, R_3, R_4$ and $R_5$ arranged in a row,where initially the seat $R_i$ is allotted to the student $S_i$,$i = 1, 2, 3, 4, 5$. But,on the examination day,the five students are randomly allotted the five seats.
$(1)$ The probability that,on the examination day,the student $S_1$ gets the previously allotted seat $R_1$,and $NONE$ of the remaining students gets the seat previously allotted to him/her is
$(A)$ $\frac{3}{40}$ $(B)$ $\frac{1}{8}$ $(C)$ $\frac{7}{40}$ $(D)$ $\frac{1}{5}$
$(2)$ For $i = 1, 2, 3, 4$,let $T_i$ denote the event that the students $S_i$ and $S_{i+1}$ do $NOT$ sit adjacent to each other on the day of the examination. Then,the probability of the event $T_1 \cap T_2 \cap T_3 \cap T_4$ is
$(A)$ $\frac{1}{15}$ $(B)$ $\frac{1}{10}$ $(C)$ $\frac{7}{60}$ $(D)$ $\frac{1}{5}$

$150$ students took admission. In how many ways can they be divided into three equal sections $A, B,$ and $C$?

If $4$ letters are placed randomly into $4$ envelopes,what is the probability that none of the letters are placed in their correct envelopes?

In how many ways can $52$ cards be distributed equally among four players?

Let the set $S = \{2, 4, 8, 16, \ldots, 512\}$ be partitioned into $3$ sets $A, B, C$ with an equal number of elements such that $A \cup B \cup C = S$ and $A \cap B = B \cap C = A \cap C = \phi$. The number of such possible partitions of $S$ is equal to: