#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
const ll MOD=1000000007;
const ll INF=1e18;

ll power(ll x, ll y){
	x%=MOD;
	if(y==0)
		return 1;
	else if(y%2)
		return x*power(x*x%MOD,y/2)%MOD;
	else
		return power(x*x%MOD,y/2);
}

int main(){
	int n, m; cin >> n >> m;
	for(int i=1;i<=m;i++){
		if(i==1)
			cout << n << endl;
		else if(n<i*2-1)
			cout << 0 << endl;
		else{
			if((n+1)%i==0)
				cout << (n/i)*power(n/i+1,i-1)%MOD << endl;
			else{
				ll a=n-(n/i-1), b=i-1;
				cout << power(a/b,b-a%b)*power(a/b+1,a%b)%MOD*(n/i-1)%MOD << endl;
			}
		}
	}
	return 0;
}