If the number of words, with or without meaning, which can be made using all the letters of the word MATHEMATICS in which $$\mathrm{C}$$ and $$\mathrm{S}$$ do not come together, is $$(6 !) \mathrm{k}$$, then $$\mathrm{k}$$ is equal to :

The number of arrangements of the letters of the word "INDEPENDENCE" in which all the vowels always occur together is :

The number of ways, in which 5 girls and 7 boys can be seated at a round table so that no two girls sit together, is :

Let the number of elements in sets $$A$$ and $$B$$ be five and two respectively. Then the number of subsets of $$A \times B$$ each having at least 3 and at most 6 elements is :