The total number of three-digit and five-digit integers which can be formed by using the digits $0, 1, 2, 3, 4, 5$,using each digit not more than once in each number,is:

Consider $4$ boxes,where each box contains $3$ red balls and $2$ blue balls. Assume that all $20$ balls are distinct. In how many different ways can $10$ balls be chosen from these $4$ boxes so that from each box at least one red ball and one blue ball are chosen?

An envelope has space for at most $3$ stamps. If you are given three stamps of denomination $1$ and three stamps of denomination $a$ (where $a > 1$),what is the least positive integer for which there is no possible stamp value?

Consider the following statements:
$(i)$ The number of one-one functions from set $A$ to set $B$,where $O(A) = m$ and $O(B) = n$ $(m \leq n)$,is given by ${}^n P_m$.
(ii) The number of ways in which $n$ people can be arranged at a circular table is $\frac{(n-1)!}{2}$.
(iii) The number of ways of selecting at least one thing out of the given $n$ distinct things is $2^n - 1$.
(iv) The number of ways in which $n$ distinguishable objects can be distributed into $k$ distinguishable bins is ${}^n C_{k-1}$.
Which of the following is true?

How many words can be formed by taking two identical and two distinct letters from the letters of the word $COMBINATION$?

Five balls of different colours are to be placed in three boxes of different sizes. Each box can hold all five balls. In how many ways can we place the balls so that no box remains empty?