Landau's Theorem on tournaments There is a Landau's theorem related to tournaments theory. Looks like the sequence $(0, 1, 3, 3, 3)$ satisfies all three conditions from the theorem, but it is not possible for 5 people to play tournament in such a way (if there are no ties). Did I miss something?

Player $A$ loses to everyone.

Player $B$ beats player $A$ and loses to everyone else.

Players $C$, $D$, and $E$ beat each other cyclically, like rock-paper-scissors.