The total number of permutations is the product of the number of options for each choice:
![$\sum_(i=0)^(n) O_{C_(i)}](https://img.qammunity.org/2019/formulas/mathematics/middle-school/kqt353gerk7htordngeq61gw0rmdymu91u.png)
For the first position there are 13 choices, for the second 12 and so on. This pattern holds until the last spot which we are told must be one of the 12 pitchers. Thus:
![N_(BO)=13 * 12*11*10*9*8*7*6*12](https://img.qammunity.org/2019/formulas/mathematics/middle-school/crp4ptrbasf85sr6yc2lej3o9q5c4qcbdo.png)
![N_(BO)=622,702,080](https://img.qammunity.org/2019/formulas/mathematics/middle-school/oi4mj5pkx8nox0js2rofm28s0fxuy313n9.png)