#include <bits/stdc++.h>

using namespace std;
typedef long long Int;

const int MOD = 1000000007;
Int C[2002][2002];

int main()
{
  int N, K;
  
  scanf("%d %d", &N, &K);
  
  for (int i = 0; i <= N + 1; i++) {
    C[i][0] = C[i][i] = 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++) {
    Int ans = C[K - 1][i - 1] * C[N - K + 1][i] % MOD;
    printf("%lld\n", ans);
  }
  
  return 0;
}