#include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;

long long modpow(long long a, long long b, long long m) {
	long long p = 1, q = a;
	for (int i = 0; i < 32; i++) {
		if ((b / (1LL << i)) % 2LL == 1) {
			p *= q; p %= m;
		}
		q *= q; q %= m;
	}
	return p;
}

long long Div(long long a, long long b, long long m) {
	return (a * modpow(b, m - 2, m)) % m;
}

long long mod = 1000000007;
long long N, K;
long long Answer1[1 << 18];
long long Answer2[1 << 18];

int main() {
	cin >> N >> K;
	long long T = modpow(2, K - 1, mod);

	// 前半組
	long long U1 = modpow(2, K - 1, N);
	long long U2 = Div((T - U1 + mod) % mod, N, mod);
	for (int i = 0; i < N; i++) Answer1[i] += U2;
	for (int i = 0; i < U1; i++) Answer1[i] += 1;

	// 後半組
	for (int i = 0; i < N; i++) Answer1[i] += U2;
	for (int i = N - 1; i >= N - U1; i--) Answer1[i] += 1;

	// 答えを合わせる
	for (int i = 0; i < N; i++) {
		Answer2[(2 * i + 1) % N] += Answer1[i];
		Answer2[(2 * i + 1) % N] %= mod;
	}
	
	// 出力
	long long Patterns = modpow(2, K, mod);
	for (int i = 0; i < N; i++) {
		cout << Div(Answer2[i], Patterns, mod) << endl;
	}
	return 0;
}