Permutations 46323

I want to find the number of permutations of the set M6 if not one element is in that position as in the original input (1 2 3 4 5 6). So I have to exclude numbers with 1 in 1st place, 2 in 2nd place, and 3 in 3rd place.

Correct answer:

n =  120

Step-by-step explanation:

$n=5\cdot 4\cdot 3\cdot 2\cdot 1\cdot 1=120$

Try another example