has n solid shapes organized in succession, with numbers from 1 to n composed on them. He'll make precisely j tasks. In every activity, he'll get 2 blocks and switch their positions. He's pondering: what number of various successions of 3D shapes would i be able to have toward the end? Since Baby Ehab is a tempestuous individual,
Correct answer will be upvoted else downvoted.
He has n solid shapes organized in succession, with numbers from 1 to n composed on them. He'll make precisely j tasks. In every activity, he'll get 2 blocks and switch their positions.
He's pondering: what number of various successions of 3D shapes would i be able to have toward the end? Since Baby Ehab is a tempestuous individual, he doesn't have the foggiest idea the number of activities he'll make, so he needs the response for each conceivable j among 1 and k.
Input
The main line contains 2 integers n and k (2≤n≤109, 1≤k≤200) — the number of solid shapes Baby Ehab has, and the boundary k from the assertion.
Output
Print k space-isolated integers. The I-th of them is the number of potential successions you can wind up with on the off chance that you do precisely I activities. Since this number can be extremely huge, print the rest of it's isolated by 109+7.
Step by step
Solved in 3 steps with 1 images
