#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=x%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N,M;
	cin>>N>>M;
	for(ll i=1;i<=M;i++){
		if(N<2*i-1){
			cout<<"0\n";
		}else{
			ll V=(N+1)/i;
			ll A=(N+1)%i;
			ll B=i-A;
			ll ans=jyo(V+1,A,mod);
			ans*=jyo(V,B-1,mod);
			ans%=mod;
			cout<<((ans*(V-1))%mod+mod)%mod<<"\n";
		}
	}
}

/*
M-1
1 1 1 ... 1 1 0
M
2 1 1 ... 1 1 0
M+1
2 2 1 ... 1 1 0
2*M-1
2 2 ... 2 2 2 1
3*M-2
3 3 ... 3 3 3 1
3*M-1
3 3 ... 3 3 3 2
A*M-1
A A ... A A A A-1
*/