#include <iostream>
#include <vector>
#include <cassert>
#define rep(i,n) for(int i=0; i<(int)(n); i++)

using namespace std;
using LL = long long;
const LL mod = 1e9+7;
const LL Max_N = 2e5;

LL modpow(LL x, LL n){
	LL r = 1;
	while(n){
		if(n & 1) r = r * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return r;
}

int main(){
  LL N, M;
  cin >> N >> M;
  assert(1 <= N and N <= Max_N);
  assert(1 <= M and M <= N);
  for(LL X = 1; X <= M; X++){
  	LL q = (N + 1) / X, r = (N + 1) % X;
  	LL ans = modpow(q + 1, r) * modpow(q, X - r - 1) % mod;
  	(ans *= q - 1) %= mod;
  	cout << ans << endl;
  }

  return 0;
}