There are m men and n monkeys (n > m). If a man have any number of monkeys. In how many ways may every monkey have a master?

Explanation

To solve the problem of how many ways every monkey can have a master when there are \( m \) men and \( n \) monkeys (with \( n > m \)), we can follow these steps:

### Step-by-Step Solution:

1. **Understanding the Problem**:
- We have \( m \) men and \( n \) monkeys.
- Each monkey can be assigned to any of the \( m \) men as their master.
- Since \( n > m \), it means that there are more monkeys than men.
...