Counting & Probability · Superchallenge problem

In how many ways can the set $\{1,2,3,4,5,6,7,8,9\}$ be partitioned into exactly four nonempty blocks (the blocks are not labeled) so that $1$, $2$ and $3$ are in three different blocks?