Migrated from Lutece 1746 高级分拆数计数

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

求 $1$ - $n$ 每个数的无序整数分拆方案，要求每个在每个拆分方案中，任意一个数的出现次数必须小于$K$.

Input

输入只有两个整数$n,K$.($1 \leq n,K \leq 10^5$)

Output

输出$n$行，分别表示从$1$到$n$时的答案，只需输出其在$\text{mod } 10^9 +7$意义下的值即可

Samples

5 5

1
2
3
5
6

Resources

Prepared by xiper