Challenge · Medium problem

A permutation of $1,2,\dots,10$ is chosen uniformly at random. An inversion is a pair of positions $i<j$ whose earlier entry is the larger. If the expected number of inversions is $\dfrac{m}{n}$ in lowest terms, find $m+n$.