#include<bits/stdc++.h>

int main(){
    using namespace std;
    constexpr unsigned long MOD = 1000000007;
    size_t n, k;
    cin >> n >> k;
    auto r = n - k;
    vector<vector<unsigned long>> C(n + 10, vector<unsigned long>(n + 10));
    C[0][0] = 1;
    for(size_t i = 1; i < n + 10; ++i){
        C[i][0] = 1;
        for(size_t j = 1; j <= i; ++j)C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
    }
    for(size_t i = 1; i <= k; ++i){
        cout << C[r + 1][i] * C[k - 1][i - 1] % MOD << endl;
    }
    return 0;
}