#pragma GCC optimize("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops") #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vld; typedef pair Pll; typedef pair Pin; ll INF = 1e16; int inf = 1e9; #define ALL(x) (x).begin(), (x).end() #define FOR(i, m, n) for (ll i = (m); i < (n); ++i) #define REVFOR(i, m, n) for (ll i = (n - 1); i >= (m); --i) #define REP(i, n) FOR(i, 0, n) #define REVREP(i, n) REVFOR(i, 0, n) #define fi first #define se second #define pb push_back #define mp make_pair #define eb emplace_back #define bcnt __builtin_popcountll #ifdef LOCAL #include #define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__); #else #define debug(...) 83; #endif void d_err() { cerr << endl; } template void d_err(H h, T... t) { cerr << h << " "; d_err(t...); } template void print(T x) { cout << x << "\n"; } template void print(vector& x) { int N = x.size(); REP(i, N) { if (i > 0) cout << " "; cout << x[i]; } cout << "\n"; } class A { public: int a() { static int v = 0; return v++; } int b() { static int v = 0; return v; } }; const ll MOD = 1000000007; //const ll MOD = 998244353; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%MOD+MOD)%MOD){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= MOD) x -= MOD; return *this; } mint& operator-=(const mint a) { if ((x += MOD-a.x) >= MOD) x -= MOD; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= MOD; return *this; } mint operator+(const mint a) const { mint res(*this); return res+=a; } mint operator-(const mint a) const { mint res(*this); return res-=a; } mint operator*(const mint a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = 1; mint tmp = *this; while(t > 0) { if (t & 1) a *= tmp; tmp *= tmp; t >>= 1; } return a; } // for prime MOD mint inv() const { return pow(MOD-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { return mint(*this) /= a; } }; istream& operator>>(istream& is, mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} typedef vector vmi; // modular exponentiation. solve x^k in O(logk) template T modexp(T x, ll k) { T ret = 1; T cur = x; while(k > 0) { if (k & 1) ret *= cur; k >>= 1; cur *= cur; } return ret; } int main(){ cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); ll n, k; cin >> n >> k; ll rm = 1; ll tmp = k - 1; ll cur = 2; while(tmp > 0) { if (tmp & 1) rm = cur * rm % n; tmp >>= 1; cur = (cur * cur % n); } mint q = modexp(mint(2), k - 1); q = (q - rm) / n; vmi cnt(n); FOR(i, 1, 2 * n) { if (~i & 1) continue; cnt[i % n] += q; if ((i + 1) / 2 <= rm) cnt[i % n] += 1; } REVFOR(i, 1, 2 * n) { if (~i & 1) continue; cnt[i % n] += q; if (rm > 0) cnt[i % n] += 1, rm--; } REP(i, n) { print(cnt[i] / mint(2).pow(k)); } }