#line 1 "main.cpp"
#include <atcoder/modint>
#include <iostream>
#include <vector>

using namespace std;
using mint0 = atcoder::modint1000000007;
using mint = atcoder::modint;

void solve() {
    int n, k;
    cin >> n >> k;
    mint::set_mod(n);

    int m = min(n, 1 << min(k, 30));

    int s = (1 - mint(2).pow(k)).val();

    vector<mint0> ans(n, 0);
    for (int d = 0; d < m; ++d) {
        int diff = (d - mint(2).pow(k)).val();
        ans[(s + d * 2) % n] += (mint0(2).pow(k) - d + diff) / n;
    }

    for (auto x : ans) cout << (x / mint0(2).pow(k)).val() << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}