#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9+7;
ll a[2010][2010];
void func(){
  for(int i=0;i<=2000;i++){
    a[i][0] = 1;
    a[i][i] = 1;
  }
  for(int i=2;i<=2000;i++){
    for(int j=1;j<i;j++){
      a[i][j] = (a[i-1][j-1] + a[i-1][j])%mod;
    }
  }
}

int main() {
  ll n,k;
  ll mul=1;
  cin >> n >> k;
  func();
  for(ll i=1;i<=k;i++){
    cout << a[n-k+1][i] * a[k-1][i-1] % mod << endl;
  }

} 