
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
Given positive integers \( m \) and \( n \) satisfying \( m \geq n \geq 2 \), there is an injective function \( f: \{1, 2, \ldots, n\} \rightarrow \{1, 2, \ldots, m\} \) such that there exists a unique \( i \) where \( i \in \{1, 2, \ldots, n-1\} \) and \( f(i) > f(i+1) \). Determine the number of such injective functions \( f \).

Present the answer in LaTex format: \boxed{Your answer}
user