From a given set of one-digit numbers, from 1 to n (1, 2, 3, 3, 4,...,n) such that 9 you want to know how many m-digit elements, such that , can be arranged with them without repeating the digits. With this statement, in a mathematically intuitive way, perform a formula to calculate and obtain the number of the "Arrangements" that can be performed.

I need only typing answer