Question 125
We will refer to a permutation $\sigma$ of the numbers from 1 to 10 as *bad*, if there exist three indices $i, j, k$, such that $1 \le i \lt j \lt k \le 10$, but $\sigma(j) \lt \sigma(k) \lt \sigma(i)$, and as *good*, otherwise. Determine the number of the good permutations.