#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 10000000000000000



int main(){
	
	int N,M;
	cin>>N>>M;
	
	for(int i=1;i<=M;i++){
		if(i==1){
			cout<<N<<endl;
			continue;
		}
		if(i==2){
			long long x = 0,y = 0;
			rep(i,N){
				if(x>y)swap(x,y);
				x += 2;
				if(x>y)swap(x,y);
				x--;
			}
			
			cout<<mint(x*y).val()<<endl;
			
			continue;
		}
		
		int a = (N-3)/(i-2);
		int b = a+1;
		long long ok = 0,ng = i-2+1;
		while(ng-ok>1){
			long long mid = (ok+ng)/2;
			if(mid*b+((long long)i-2-mid)*a > (N-3))ng = mid;
			else ok = mid;
		}
		
		mint ans = mint(a).pow(i-2-ok);
		ans *= mint(b).pow(ok);
		ans *= 2;
		
		cout<<ans.val()<<endl;
		
	}
	
    return 0;
}