9. Team A and Team B each send out 7 players to participate in a Go chess tournament according to a pre-arranged order. Both sides start with the No. 1 player competing, the loser is eliminated, and the winner then competes with the No. 2 player of the losing side, ..., until all players of one side are eliminated, and the other side wins, forming a match process. Then the total number of all possible match processes is $\qquad$ .
Let the players of Team A be numbered as $a_{1}, a_{2}, \cdots, a_{7}$, and the players of Team B be numbered as $b_{1}, b_{2}, \cdots, b_{7}$. Record the numbers of the players eliminated from both sides in sequence. When one side wins, record the numbers of the remaining players of the winning side in order. For example, $a_{1} a_{2} b_{1} a_{3} b_{2} b_{3} b_{4} a_{4} b_{5} a_{5} b_{6} b_{7} a_{6} a_{7}$ indicates that ultimately $a_{6}$ beats $b_{6}, b_{7}$, and Team A wins. Each match process is thus a fixed sequence of $a_{1}, a_{2}, \cdots, a_{7}$ and $b_{1}, b_{2}, \cdots, b_{7}$, so the number of match processes is $C_{14}^{7}=3432$.