#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 924844033; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

/**
 * Description: modular arithmetic operations 
 * Source: 
    * KACTL
    * https://codeforces.com/blog/entry/63903
    * https://codeforces.com/contest/1261/submission/65632855 (tourist)
    * https://codeforces.com/contest/1264/submission/66344993 (ksun)
 * Verification: 
    * https://open.kattis.com/problems/modulararithmetic
 */

struct mi {
    typedef decay<decltype(MOD)>::type T; 
     /// don't silently convert to T
    T v; explicit operator T() const { return v; }
    mi() { v = 0; }
    mi(ll _v) { 
        v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
        if (v < 0) v += MOD;
    }
    friend bool operator==(const mi& a, const mi& b) { 
        return a.v == b.v; }
    friend bool operator!=(const mi& a, const mi& b) { 
        return !(a == b); }
    friend bool operator<(const mi& a, const mi& b) { 
        return a.v < b.v; }
    friend void re(mi& a) { ll x; re(x); a = mi(x); }
    friend str ts(mi a) { return ts(a.v); }
   
    mi& operator+=(const mi& m) { 
        if ((v += m.v) >= MOD) v -= MOD; 
        return *this; }
    mi& operator-=(const mi& m) { 
        if ((v -= m.v) < 0) v += MOD; 
        return *this; }
    mi& operator*=(const mi& m) { 
        v = (ll)v*m.v%MOD; return *this; }
    mi& operator/=(const mi& m) { return (*this) *= inv(m); }
    friend mi pow(mi a, ll p) {
        mi ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend mi inv(const mi& a) { assert(a.v != 0); 
        return pow(a,MOD-2); }
        
    mi operator-() const { return mi(-v); }
    mi& operator++() { return *this += 1; }
    mi& operator--() { return *this -= 1; }
    friend mi operator+(mi a, const mi& b) { return a += b; }
    friend mi operator-(mi a, const mi& b) { return a -= b; }
    friend mi operator*(mi a, const mi& b) { return a *= b; }
    friend mi operator/(mi a, const mi& b) { return a /= b; }
};
typedef vector<mi> vmi;
typedef pair<mi,mi> pmi;
typedef vector<pmi> vpmi;

/**
 * Description: pre-compute factorial mod inverses,
     * assumes $MOD$ is prime and $SZ < MOD$.
 * Time: O(SZ)
 * Source: KACTL
 * Verification: https://dmoj.ca/problem/tle17c4p5
 */

vi invs, fac, ifac;
void genFac(int SZ) {
    invs.rsz(SZ), fac.rsz(SZ), ifac.rsz(SZ); 
    invs[1] = fac[0] = ifac[0] = 1; 
    FOR(i,2,SZ) invs[i] = MOD-(ll)MOD/i*invs[MOD%i]%MOD;
    FOR(i,1,SZ) {
        fac[i] = (ll)fac[i-1]*i%MOD;
        ifac[i] = (ll)ifac[i-1]*invs[i]%MOD;
    }
}

ll comb(int a, int b) {
    if (a < b || b < 0) return 0;
    return (ll)fac[a]*ifac[b]%MOD*ifac[a-b]%MOD;
}





/**
 * Description: Multiply two polynomials. For xor convolution 
     * don't multiply \texttt{v} by \texttt{roots[ind]}. If
     * product of sizes is at most a certain threshold (ex. 10000)
     * then it's faster to multiply directly.
 * Time: O(N\log N)
 * Source: 
     * KACTL
     * https://cp-algorithms.com/algebra/fft.html
     * https://csacademy.com/blog/fast-fourier-transform-and-variations-of-it
 * Verification: 
    * SPOJ polymul, CSA manhattan, CF Perfect Encoding
    * http://codeforces.com/contest/632/problem/E
 */


const int root = 5;
// For p < 2^30 there is also e.g. (5<<25, 3), (7<<26, 3) 
/// (479<<21, 3) and (483<<21, 5). Last two are > 10^9.
void genRoots(vmi& roots) { // REPLACE DEF OF MOD
    int n = sz(roots); mi r = pow(mi(root),(MOD-1)/n);
    roots[0] = 1; FOR(i,1,n) roots[i] = roots[i-1]*r; }
typedef complex<db> cd; typedef vector<cd> vcd;
void genRoots(vcd& roots) { // primitive n-th roots of unity
    int n = sz(roots); db ang = 2*PI/n;
    /// good way to compute these trig functions more quickly?
    F0R(i,n) roots[i] = cd(cos(ang*i),sin(ang*i)); }

int size(int s) { return s > 1 ? 32-__builtin_clz(s-1) : 0; }
template<class T> void fft(vector<T>& a, 
  const vector<T>& rts, bool inv = 0) {
    int n = sz(a);
    for (int i = 1, j = 0; i < n; i++) { 
        int bit = n>>1; for (; j&bit; bit /= 2) j ^= bit;
        j ^= bit; if (i < j) swap(a[i],a[j]);
    } // sort #s from 0 to n-1 by reverse binary
    for (int len = 1; len < n; len *= 2)
        for (int i = 0; i < n; i += 2*len) F0R(j,len) {
            T u = a[i+j], v = a[i+j+len]*rts[n/2/len*j];
            a[i+j] = u+v, a[i+j+len] = u-v;
        }
    if (inv) {
        reverse(1+all(a));
        T i = T(1)/T(n); trav(x,a) x *= i; 
    }
}
template<class T> vector<T> mul(vector<T> a, vector<T> b) {
    if (!min(sz(a),sz(b))) return {};
    int s = sz(a)+sz(b)-1, n = 1<<size(s);
    vector<T> roots(n); genRoots(roots);
    a.rsz(n), fft(a,roots); b.rsz(n), fft(b,roots);
    F0R(i,n) a[i] *= b[i];
    fft(a,roots,1); a.rsz(s); return a;
}


/**
 * Description: Multiply two polynomials with arbitrary $MOD.$
    * Ensures precision by splitting into halves.
 * Source: KACTL, https://cp-algorithms.com/algebra/fft.html
 * Time: $\sim$0.8s when \texttt{sz(a)=sz(b)=1<<19}
 * Verification: see FFT
 */


vl mulMod(const vl& a, const vl& b) { 
    if (!min(sz(a),sz(b))) return {};
    int s = sz(a)+sz(b)-1, n = 1<<size(s), cut = sqrt(MOD);
    vcd roots(n); genRoots(roots);
    vcd ax(n), bx(n);
    // ax(x)=a1(x)+i*a0(x)
    F0R(i,sz(a)) ax[i] = cd((int)a[i]/cut, (int)a[i]%cut); 
    // bx(x)=b1(x)+i*b0(x)
    F0R(i,sz(b)) bx[i] = cd((int)b[i]/cut, (int)b[i]%cut); 
    fft(ax,roots), fft(bx,roots);
    vcd v1(n), v0(n);
    F0R(i,n) {
        int j = (i ? (n-i) : i);
        // v1 = a1*(b1+b0*cd(0,1));
        v1[i] = (ax[i]+conj(ax[j]))*cd(0.5,0)*bx[i]; 
        // v0 = a0*(b1+b0*cd(0,1));
        v0[i] = (ax[i]-conj(ax[j]))*cd(0,-0.5)*bx[i]; 
    }
    fft(v1,roots,1), fft(v0,roots,1);
    vl ret(n);
    F0R(i,n) {
        ll V2 = (ll)round(v1[i].real()); // a1*b1
        ll V1 = (ll)round(v1[i].imag())+(ll)round(v0[i].real()); 
        // a0*b1+a1*b0
        ll V0 = (ll)round(v0[i].imag()); // a0*b0
        ret[i] = ((V2%MOD*cut+V1)%MOD*cut+V0)%MOD;
    }
    ret.rsz(s); return ret;
} 


const int mx = 200005;
vi adj[mx];
int c[mx];
int N, M;

int genC(int node, int prv = -1){
    int subsize = 1;
    for(auto u: adj[node]){
        if(u == prv) continue;
        subsize+=genC(u, node);
    }

    if(node != 1){
        c[subsize]++;
        c[N-subsize]++;
    }
    return subsize;
}

int main() {
    setIO();

    cin >> N;
    M = N+5;
    for(int i = 1; i <= N-1; i++){
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    genC(1);
    genFac(N+100);
    
    vl a(N+1, 0), b(M+1);
    for(int i = 0; i <= N; i++){
        a[i] = (ll(fac[i])*c[i]) % MOD;
    }
    for(int i = 0; i <= M; i++){
        b[i] = ifac[M-i];
    }
    vl pans = mulMod(a, b);
    for(int K = 1; K <= N; K++){
        mi ans = mi(pans[M+K]);
        ans = mi(N)*mi(comb(N, K))-mi(ifac[K])*ans;
        ps(ans);
    }


    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/



Measured memory_bytes: 73748