#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=144494;
ll mod=1000000007;
ll modpow(ll x, ll n) {
  x = x%mod;
  if(n==0) return 1;  //再帰の終了条件

  else if(n%2==1) {
    return (x*modpow(x, n-1))%mod;  //nが奇数ならnを1ずらす
  }
  else return modpow((x*x)%mod, n/2)%mod;  //nが偶数ならnが半分になる
}
int main(){
    ll n,m;
    cin >> n >> m;
    for (ll i = 1; i <= m; i++)
    {
        if (i==n)
        {
            cout << 0 << endl;
            return 0;
        }
        ll x=n/i;
        ll y=n%i;
        ll ans=modpow(x+1,y);
        ans*=modpow(x,i-y);
        ans%=mod;
        cout << ans << endl;
    }
}