CMO 1990 Problem 2

$\frac{n(n + 1)}{2}$ distinct numbers are arranged at random into $n$ rows. The first row has $1$ number, the second has $2$ numbers, the third has $3$ numbers and so on. Find the probability that the largest number in each row is smaller than the largest number in each row with more numbers.