#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,int> P;

ll C[2100][2100];

int main(){
  for(int i=0;i<2100;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;
    }
  }

  int N,K;
  cin>>N>>K;

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