import java.util.*
fun main(args: Array<String>){
	val cin = Scanner(System.`in`)
    val n = cin.nextInt()
    val k = cin.nextInt()

    val mod: Long = 1000000007

    val c = Array<Array<Int>>(n+1, { Array<Int>(n+1, { 0 })})

    for (i in 0..n) {
        for (j in 0..n) {
            if (j > i) {
                continue
            } else if (j == 0) {
                c[i][j] = 1
            } else {
                val c_long: Long = c[i-1][j-1].toLong() + c[i-1][j].toLong()
                c[i][j] = (c_long % mod).toInt()
            }
        }
    }

    for (i in 1..k) {
        println((c[k-1][i-1].toLong() * c[n-k+1][i].toLong()) % mod)
    }
}