#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2007, mod = 1e9 + 7;
ll c[N][N];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;
    for(int i = 0; i <= n + 1; ++i){
        c[i][0] = 1;
        for(int j = 1; j <= i; ++j)
            c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
    for(int i = 1; i <= k; ++i) 
        cout <<  c[k - 1][i - 1] * c[n - k + 1][i] % mod << endl;
    return 0;
}