When the $X_i$ are sorted in ascending order, the positions of $X_1, \ldots, X_m$ (which form a subset of the $n$ positions) are random and equidistributed (assuming, that is, either exchangeability of the $X_i$ or the stronger "iid" assumption of independence and equal distributions). This means that each possible subset of the $n$ positions has a constant chance of $1/\binom{n}{m}$ of occurring.
The event described in the question happens when two of these $m$ values are situated in the first four positions, one of these $m$ values is in the fifth position, and the remaining $m-3$ values are in the remaining $n-5$ positions.
There are $\binom{4}{2}=6$ ways to fill the first four positions, $\binom{1}{1}=1$ way to fill the fifth position, and $\binom{n-5}{m-3}$ ways to fill the last positions. The total number of subsets in the event is the product of these counts. Therefore the chance of the event is
$$\frac{\binom{4}{2}\binom{1}{1}\binom{n-5}{m-3}}{\binom{n}{m}} = 6\frac{\binom{n-5}{m-3}}{\binom{n}{m}}.$$