#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18
#define mod 1000000007

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} 

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i<vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    cout << head;
    if(sizeof...(Tail) > 0) cout << " ";
    dump_func(std::move(tail)...);
}


llint modpow(llint a, llint n, ll m)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%m) * (modpow(a, n-1, m)%m)) % m;
	}
	else{
		return modpow((a*a)%m, n/2, m) % m;
	}
}


ll n, k;
ll ans[100005];

P mul(P a, P b, ll n)
{
	ll x = a.first*b.first%mod*n%mod + a.first*b.second%mod + a.second*b.first%mod;
	x += (a.second*b.second) / n, x %= mod;
	ll y = (a.second*b.second) % n;
	return P(x, y);
}

P calc(ll k, ll n)
{
	if(k == 0) return P(0, 1);
	if(k % 2){
		return mul(P(0, 2), calc(k-1, n), n);
	}
	else{
		P res = calc(k/2, n);
		return mul(res, res, n);
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	
	ll p = (n - modpow(2, k, n) + 1) % n;
	if(n % 2){
		P res = calc(k, n);
		rep(i, 0, n-1) ans[i] = res.first;
		rep(i, 0, res.second-1) ans[(p+2*i)%n]++;
	}
	else{
		P res = calc(k, n/2);
		rep(i, 0, n/2-1) ans[(p+2*i)%n] = res.first;
		rep(i, 0, res.second-1) ans[(p+2*i)%n]++;
	}
	ll d = modpow(modpow(2, k, mod), mod-2, mod);
	rep(i, 0, n-1) outl(ans[i]*d%mod);
	
	return 0;
}