#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif

#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rsz resize()
#define lb lower_bound
#define ub upper_bound
#define br cout << endl

typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); } 
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }

vector<int> get_bits(int mask) {
	vector<int> bb;
	while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
	reverse(all(bb));
	return bb;
}

int get_mask(vector<int> v) {
	int mask = 0;
	for(int x : v) { mask ^= (1 << x); }
	return mask;
}

template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }
template<typename T>
void leftShift(vector<T> &v, ll k) { k %= sz(v); if(k < 0) k += sz(v); rotate(v.begin(), v.begin() + k, v.end()); }
template<typename T>
void rightShift(vector<T> &v, ll k) { leftShift(v, sz(v) - k); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll rand(ll l, ll r){
	uniform_int_distribution<ll> uid(l, r);
	return uid(rng);
}

void sc() {}

template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }

#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#ifndef LOCAL
string to_string(__int128 x) {
	string s = "";
	bool neg = 0;
	if(x < 0) { s += "-"; neg = 1; x = -x; }
	if(!x) s += '0';
	while(x) {
		int rem = x % 10;
		s += to_string(rem);
		x /= 10;
	}
	reverse(s.begin() + neg, s.end());
	return s;
}
#endif

// const int mod = 1e9 + 7; // 998244353;

// int pwr(int a,int b) {
// 	int ans = 1;
// 	while(b) {
// 		if(b & 1) ans = (ans * 1LL * a) % mod;
// 		a = (a * 1LL * a) % mod;
// 		b >>= 1;
// 	}
// 	return ans;
// }

/*
	Lookout for overflows!!
	Check array sizes!!
	Clear before test cases!!
	Use the correct modulo!!
	Check for corner cases!!
	Are you forgetting something?!
	Read problem statement carefully!!!
*/

// Has to be tested

#define vi vector<int>
const int mod = 924844033;
const int root = 5;
const int MAX = 20;

int pwr(int a,int b){
    int ans = 1;
    while(b){
        if(b & 1)
            ans = (ans * 1LL * a) % mod;
        a = (a * 1LL * a) % mod;
        b >>= 1;
    }
    return ans;
}

ll iv[(1 << MAX) + 1];
struct ntt {
    ll rt[1 << MAX];
    void pre(int n) {
        rt[n / 2] = 1;
        rt[n / 2 + 1] = pwr(root, (mod - 1) / n);
        for(int i = n / 2 + 2; i < n; ++i)
            rt[i] = rt[i - 1] * rt[n / 2 + 1] % mod;
        for(int i = n / 2; --i; )
            rt[i] = rt[i << 1];
        iv[1] = 1;
        for(int i = 2; i <= (1 << MAX); ++i)
            iv[i] = mod - ((mod / i) * iv[mod % i]) % mod;
    }
    void go(vi &a) {
        int n = a.size();
        for(int i = 0, j = 0; i < n; ++i) {
            if(i > j)
                swap(a[i], a[j]);
            for(int k = n / 2; (j ^= k) < k; k >>= 1);
        }
        for(int st = 1; (st << 1) <= n; st <<= 1) {
            for(int i = 0; i < n; i += (st << 1)) {
                for(int j = i; j < i + st; ++j) {
                    int z = (rt[j - i + st] * a[j + st]) % mod;
                    a[j + st] = a[j] - z;
                    if(a[j + st] < 0)
                        a[j + st] += mod;
                    a[j] += z;
                    if(a[j] >= mod)
                        a[j] -= mod;
                }
            }
        }
    }
} nt;

vi mult(vi v, vi w) {
    int s = sz(v) + sz(w) - 1, t = 1;
    while(t < s)
        t <<= 1;
    v.resize(t, 0), w.resize(t, 0);
    nt.go(v), nt.go(w);
    ll I = iv[t];
    for(int i = 0; i < t; ++i)
        v[i] = (((v[i] * 1LL * w[i]) % mod) * I) % mod;
    reverse(v.begin() + 1, v.end());
    nt.go(v);
    while(!v.empty() && !v.back())
        v.pop_back();
    return v;
}

const int N = 2e5 + 5; 
int c[N];
vector<int> g[N];
int n;

int fact[N], ifact[N];

int ncr(int n,int k) {
    if(n < k || k < 0) return 0;
    int ans = (fact[n] * 1LL * ifact[k]) % mod;
    return (ans * 1LL * ifact[n - k]) % mod;
}

int dfs(int u,int p) {
    int t = 1;
    for(int v : g[u]) {
        if(v != p) {
            int s = dfs(v, u);
            t += s;
            c[s]++;
            c[n - s]++;
        }
    }
    return t;
}

void solve() {
    fact[0] = 1;
    fr(i, 1, N - 1) {
        fact[i] = (i * 1LL * fact[i - 1]) % mod;
    }
    ifact[N - 1] = pwr(fact[N - 1], mod - 2);
    for(int i = N - 2; i >= 0; i--) {
        ifact[i] = (ifact[i + 1] * 1LL * (i + 1)) % mod;
    }
    debug(ifact[2]);
	nt.pre(1 << MAX);
    sc(n);
    fr(i, 1, n - 1) {
        int u, v;
        sc(u, v);
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(1, 0);
    vi cp(n, 0);
    fr(i, 0, n - 1) {
        cp[i] = (c[i] * 1LL * fact[i]) % mod;
    }
    const int M = n;
    vi g(M + 1, 0);
    fr(k, 0, M) {
        g[k] = ifact[M - k];
    }
    vi ans = mult(cp, g);
    ans.resize(M + n + 1, 0);
    debug(cp, g, ans);
    debug(ans[M + 1]);
    fr(k, 1, n) {
        int val = ans[M + k];
        val = (val * 1LL * ifact[k]) % mod;
        debug(k, val);
        val = (n * 1LL * ncr(n, k) - val + mod) % mod;
        cout << val << endl;
    }
}

signed main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	// cin >> t;
	for(int tt = 1; tt <= t; tt++) {
		solve();
	}
	return 0;
}

Measured memory_bytes: 44400