There are $3$ sections in a question paper and each section contains $5$ questions. $A$ candidate has to answer a total of $5$ questions,choosing at least one question from each section. Then the number of ways,in which the candidate can choose the questions,is

The number of seven-digit positive integers formed using the digits $1, 2, 3,$ and $4$ only,such that the sum of the digits is equal to $12$,is $...........$.

$A$ man $X$ has $7$ friends,$4$ of them are ladies and $3$ are men. His wife $Y$ also has $7$ friends,$3$ of them are ladies and $4$ are men. Assume $X$ and $Y$ have no common friends. The total number of ways in which $X$ and $Y$ together can throw a party inviting $3$ ladies and $3$ men,such that $3$ friends of each of $X$ and $Y$ are invited,is:

All the arrangements,with or without meaning,of the word $FARMER$ are written excluding any word that has two $R$ appearing together. The arrangements are listed serially in the alphabetic order as in the English dictionary. Then the serial number of the word $FARMER$ in this list is .... .

What is the remainder when $1! + 2! + 3! + \dots + 200!$ is divided by $14$?

Match the items of List-$I$ to the items of List-$II$:

	List-$I$		List-$II$
$(A)$	The number of ways of not selecting $(n-r)$ things from $n$ different things	$(I)$	$1+n+{ }^n C_2+\ldots+{ }^n C_r$
$(B)$	$(n-r+1) \cdot{ }^n C_{r-1}$	$(II)$	$(r+1) \cdot{ }^n C_{r+1}$
$(C)$	The number of ways of selecting at least $(n-r)$ things from $n$ different things	$(III)$	$r\left({ }^n C_r\right)$
$(D)$	$(n-r)\left({ }^{n-1} C_{r-1}+{ }^{n-1} C_r\right)$	$(IV)$	$2^n-1-n-{ }^n C_2-\ldots-{ }^n C_r$
		$(V)$	${ }^n C_{n-r}$

The correct match is: