CF755G PolandBall and Many Other Balls

PolandBall is standing in a row with Many Other Balls. More precisely, there are exactly $ n $ Balls. Balls are proud of their home land — and they want to prove that it's strong. The Balls decided to start with selecting exactly $ m $ groups of Balls, each consisting either of single Ball or two neighboring Balls. Each Ball can join no more than one group. The Balls really want to impress their Enemies. They kindly asked you to calculate number of such divisions for all $ m $ where $ 1

N/A

N/A

In the first sample case we can divide Balls into groups as follows: $ {1} $ , $ {2} $ , $ {3} $ , $ {12} $ , $ {23} $ . $ {12}{3} $ , $ {1}{23} $ , $ {1}{2} $ , $ {1}{3} $ , $ {2}{3} $ . $ {1}{2}{3} $ . Therefore, output is: 5 5 1.