#include<iostream>
using namespace std;
const long mod=1e9+7;
long mp(long a,long b,long m){return b?mp(a*a%m,b/2,m)*(b%2?a:1)%m:1;}
int N,K;
main()
{
	cin>>N>>K;
	int nr=(mp(2,K,2*N)+2*N-1)%(2*N);
	long all=(mp(2,K,mod)+mod-nr-1)*mp(2*N,mod-2,mod)%mod;
	long inv=mp(mp(2,K,mod),mod-2,mod);
	for(int i=0;i<N;i++)
	{
		if(N%2==1)
		{
			long ans=all*2;
			if(nr>=(i%2==0?N+i:i))ans++;
			if(2*N-nr<=(i%2==0?N+i:i))ans++;
			cout<<ans*inv%mod<<endl;
		}
		else if(i%2==0)cout<<0<<endl;
		else
		{
			long ans=all*4;
			if(nr>=i)ans++;
			if(nr>=N+i)ans++;
			if(2*N-nr<=i)ans++;
			if(2*N-nr<=N+i)ans++;
			cout<<ans*inv%mod<<endl;
		}
	}
}