Yu and eS, the two brothers, have come home after a very long and tiring journey. The younger brother eS is still full of energy and wants to play with Yu. Yu is totally exhausted and wants some sleep. In no mood to play, Yu agrees to play only if eS solves the following problem.
Yu gives eS two integers N and M. He asks eS to consider an array A containing N elements with each element being a positive integer M. Yu further goes on by defining a function $F(k)\space =$ Number of such arrays A with exactly K distinct elements. He asks eS to calculate $F(K) \space \forall\space k \in [1..M]$.

After giving him a devilish grin, Yu went back to sleep. eS realized that it would take him a millennia to count the number of arrays. Can you help the poor lad to have some playtime with his indolent brother.

INPUT
The first line contains two space separated integers N and M.

OUTPUT
Print M space separated integers $F(1)\space F(2) \space\dots\space F(M)$. Since the values can be quite large print them modulo $10^9+7$.

CONSTRAINTS
$1 ≤ N ≤ 10^9$
$1 ≤ M ≤ 5000$