Directed Graphs and Network Flows · Superchallenge problem

Teams $1,\dots,6$ play a round robin ($15$ games total). Among all $2^{15}$ ways the games could be decided, in how many does the sorted list of the six teams' win totals come out to exactly $1,2,2,3,3,4$?