#include<iostream>

using namespace std;

long long dp[3010][3010];
const int MOD = 1000000007;
int main()
{
    int n, k;

    cin>>n>>k;
    
    dp[0][0] = 1;

    for(int i=1;i<=2000;i++)
        for(int j=1;j<=2000;j++)
        {
            dp[i][j] = dp[i-1][j-1] + dp[i-1][j];
            dp[i][j] = dp[i][j] % MOD;
        }
    for(int i=1;i<=k;i++)
    {
        long long ans = dp[k][i] * (dp[n-k][i] + dp[n-k][i] + dp[n-k][i-1] + dp[n-k][i+1]);
        cout<<ans%MOD<<endl;
    }
    
}