#include <bits/stdc++.h>
using namespace std;

const int64_t MOD = 924844033;
const int64_t ROOT = 5;
const int MX_PW = 21;
void add(int64_t& a, int64_t b){
    a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
    a = a*b % MOD;
}

vector<int64_t> fact, seq_inv, fact_inv;

void create_fact_mod(int num){
    fact[0] = fact[1] = 1;
    for(int i=2; i<=num; i++) fact[i] = fact[i-1] * i % MOD;
}

void create_seq_inv_mod(int num){
    seq_inv[0] = seq_inv[1] = 1;
    for(int i=2; i<=num; i++) seq_inv[i] = (MOD - MOD/i) * seq_inv[MOD%i] % MOD;
}

void create_fact_inv_mod(int num){
    fact_inv[0] = fact_inv[1] = 1;
    for(int i=2; i<=num; i++) fact_inv[i] = fact_inv[i-1] * seq_inv[i] % MOD;
}

void create_mod_tables(int num){
    fact.resize(num+1);
    seq_inv.resize(num+1);
    fact_inv.resize(num+1);
    create_fact_mod(num);
    create_seq_inv_mod(num);
    create_fact_inv_mod(num);
}

int64_t comb_mod(int n, int k){
    return fact[n] * fact_inv[n-k] % MOD * fact_inv[k] % MOD;
}

int64_t perm_mod(int n, int k){
    return fact[n] * fact_inv[n-k] % MOD;
}

int64_t power_mod(int64_t num, int64_t power){
    int64_t prod = 1;
    num %= MOD;
    while(power > 0){
        if(power&1) prod = prod * num % MOD;
        num = num * num % MOD;
        power >>= 1;
    }
    return prod;
}

int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
    int64_t d = a;
    if(b != 0){
        d = extgcd(b, a%b, y, x);
        y -= (a/b) * x;
    }else{
        x = 1; y = 0;
    }
    return d;
}

int64_t inv_mod(int64_t a){
    int64_t x, y;
    extgcd(a, MOD, x, y);
    return (MOD + x%MOD) % MOD;
}

vector<int64_t> zeta, zeta_inv;

void prepare_ntt(){
    zeta.resize(MX_PW);
    zeta_inv.resize(MX_PW);
    zeta[MX_PW-1] = power_mod(ROOT, (MOD-1)/(1<<MX_PW));
    zeta_inv[MX_PW-1] = inv_mod(zeta[MX_PW-1]);
    for(int k=MX_PW-2; k>=0; k--){
        zeta[k] = zeta[k+1] * zeta[k+1] % MOD;
        zeta_inv[k] = zeta_inv[k+1] * zeta_inv[k+1] % MOD;
    }
}

void dft(vector<int64_t>& f, int n, bool inverse){
    if(n==1) return;
    int c = 0;
    for(int i=1; i<n; i++){
        for(int j=(n>>1); j>(c^=j); j>>=1);
        if(c > i){
            swap(f[c], f[i]);
        }
    }

    for(int i=1, k=0; i<n; i<<=1, k++){
        int64_t w = (inverse ? zeta_inv[k] : zeta[k]);
        for(int j=0; j<n; j+=2*i){
            int64_t wn = 1;
            for(int k=0; k<i; k++){
                int64_t u = f[k+j];
                int64_t v = f[k+j+i] * wn % MOD;
                f[k+j] = (u+v) % MOD;
                f[k+j+i] = (u-v+MOD) % MOD;
                wn = wn * w % MOD;
            }
        }
    }
}
 
vector<int64_t> convolution(const vector<int64_t>& ff, const vector<int64_t>& gg){
    if(zeta.size() == 0) prepare_ntt();
    vector<int64_t> f, g;
    int fsz = ff.size(), gsz = gg.size();
    for(int i=0; i<fsz; i++) f.push_back(ff[i]);
    for(int i=0; i<gsz; i++) g.push_back(gg[i]);
    int n = 1;
    while(n <= fsz+gsz) n <<= 1;
	f.resize(n);
	g.resize(n);
    dft(f, n, false);
    dft(g, n, false);

    int64_t ninv = inv_mod(n);
 
    vector<int64_t> h(n);
    for(int i=0; i<n; i++) h[i] = f[i] * g[i];
    dft(h, n, true);
 
    vector<int64_t> ret(fsz+gsz-1);
    for(int i=0; i<fsz+gsz-1; i++) ret[i] = h[i] * ninv % MOD;
    while(ret.size() && ret.back() == 0) ret.pop_back();
    return ret;
}

int N;
vector<int> edges[200000];
int num[200001];

int dfs(int i, int p){
    int sz = 1;
    for(int j : edges[i]) if(j != p){
        int res = dfs(j, i);
        num[res]++;
        sz += res;
    }
    if(sz < N) num[N-sz]++;
    return sz;
}

int main(){
    cin >> N;
    create_mod_tables(N);
    for(int i=0; i<N-1; i++){
        int a, b;
        cin >> a >> b;
        edges[a-1].push_back(b-1);
        edges[b-1].push_back(a-1);
    }
    dfs(0, -1);

    vector<int64_t> A(N+1), B(N+1);
    for(int i=0; i<=N; i++){
        A[i] = fact_inv[i];
        B[i] = num[N-i] * fact[N-i] % MOD;
    }
    auto conv = convolution(A, B);

    vector<int64_t> ans(N+1);
    for(int i=1; i<=N; i++){
        int64_t ans = comb_mod(N, i) * N % MOD;
        int64_t sub = conv[N-i] * fact_inv[i] % MOD;
        add(ans, MOD-sub);
        cout << ans << endl;
    }

    return 0;
}


Measured memory_bytes: 43324