#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

constexpr int P = 1000000007;

ll powmod(ll n, ll k, int Mod) {
    ll r = 1, t = n % Mod;
    for (; k != 0; k /= 2) {
        if (k & 1) r = r * t % Mod;
        t = t * t % Mod;
    }
    return r;
}
ll modinv(ll n) {
    return powmod(n, P - 2, P);
}

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

    int n, k;
    cin >> n >> k;

    int t = -(powmod(2, k, n) - 1);
    t %= n;
    if (t < 0) t += n;

    int y = modinv(powmod(2, k, P));

    vector<int> r(n);
    int n0 = n % 2 == 0 ? n / 2 : n;
    int m = powmod(2, k, n0);
    ll s = (powmod(2, k, P) - m) * modinv(n0) % P;
    if (s < 0) s += P;
    for (int i = 0; i < n0; i++) {
        r[(t + i * 2) % n] = (s + (i < m ? 1 : 0)) * y % P;
    }

    for (int i = 0; i < n; i++) {
        cout << r[i] << '\n';
    }

    return 0;
}