#include<iostream>
using namespace std;

typedef long long ll;
const ll mod = 1e9+7;

ll modpow(ll a, ll b, ll p = 1e9+7){
    if(b == 0)  return 1;

    if(b % 2 == 0){
        ll d = modpow(a, b/2, p);
        return (d*d) % p;
    }else{
        return (a%p * modpow(a, b-1, p)) % p;
    }
}

int main(){
    ll n, m;
    cin >> n >> m;
    cout << n << endl;
    for(int i = 2; i <= m; i++){
        if(n+1 < 2*i){
            cout << 0 << endl;
        }else if(i == 2){
            cout << n/2*(n-n/2)%mod << endl;    
        }else{ 
            int j = i-1;
            int x = n-1;
            cout << modpow(x/j, j-x%j)*modpow(x/j+1, x%j)%mod << endl;
        }
    }
    return 0;
}