#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll MOD=1e9+7;

ll C[2100][2100];

int main() {
    int N,K; cin>>N>>K;

    for (int i=0;i<=N;i++) {
        for (int j=0;j<=i;j++) {
            if (j==0) C[i][j]=1;
            else C[i][j]=C[i-1][j]+C[i-1][j-1];
            C[i][j] %= MOD;
        }
    }

    for (int i=1;i<=K;i++) {
         cout << C[N-K+1][i] * C[K-1][i-1] % MOD << endl;
    }

    return 0;
}