// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



const int P = 924844033;

const int N = 200000 + 5;

const int MAX = 524288 + 5;



int n;



vector <int> G[N];

int siz[N];



int f1[MAX];

int f2[MAX];



int a[N];



int fac[N];

int inv[N];



void dfs(int u, int fa) {

  siz[u] = 1;

  for (int i = 0; i < (int) G[u].size(); ++i) {

    int v = G[u][i];

    if (v == fa) {

      continue;

    }

    dfs(v, u);

    --a[siz[v]];

    siz[u] += siz[v];

  }

  --a[n - siz[u]];

}



int lim;

int bit;



int rev(int x) {

  int ret = 0;

  for (int i = 0; i < bit; ++i) {

    ret <<= 1;

    ret |= x & 1;

    x >>= 1;

  }

  return ret;

}



int revbit[MAX];

int g[MAX];



void fft(int *f, int bit, int o) {

  for (int i = 0; i < lim; ++i) {

    if (revbit[i] > i) {

      swap(f[revbit[i]], f[i]);

    }

  }

  for (int i = 0; i < bit; ++i) {

    int len = 1 << i;

    for (int j = 0; j < lim; j += 1 << i + 1) {

      int wn = 0;

      for (int k = j; k < j + len; ++k) {

        int t = (long long) f[k + len] * g[wn] % P;

        f[k + len] = (f[k] - t) % P;

        if (f[k + len] < 0) {

          f[k + len] += P;

        }

        f[k] = (f[k] + t) % P;

        wn += o * (1 << bit - i - 1);                        

        if (wn < 0) {

          wn += lim;

        }

      }

    }

  }

}



int modexp(int a, int x, int P) {

  int ret = 1;

  while (x) {

    if (x & 1) {

      ret = (long long) ret * a % P;

    }

    a = (long long) a * a % P;

    x >>= 1;

  }

  return ret;

}



void calc() {

  while ((1 << bit) < n + n) {

    ++bit;   

  }

  lim = 1 << bit;

  for (int i = 0; i < lim; ++i) {

    revbit[i] = rev(i);

  }

  g[0] = 1;

  g[1] = modexp(5, (P - 1) / lim, P);

  for (int i = 2; i < lim; ++i) {

    g[i] = (long long) g[i - 1] * g[1] % P;

  }

  fft(f1, bit, 1);

  fft(f2, bit, 1);

  for (int i = 0; i < lim; ++i) {

    f1[i] = (long long) f1[i] * f2[i] % P;

  }

  fft(f1, bit, -1);

  int invlim = modexp(lim, P - 2, P);

  for (int i = 0; i < lim; ++i) {

    f1[i] = (long long) f1[i] * invlim % P;

  }    

}



int main() {

  scanf("%d", &n);

  for (int i = 0, u, v; i < n - 1; ++i) {

    scanf("%d %d", &u, &v);

    --v;

    --u;

    G[u].push_back(v);

    G[v].push_back(u);

  }

  dfs(0, -1);

  a[n] = n;

  fac[0] = 1;

  for (int i = 1; i <= n; ++i) {

    fac[i] = (long long) fac[i - 1] * i % P;

  }

  inv[n] = modexp(fac[n], P - 2, P);

  for (int i = n - 1; i >= 0; --i) {

    inv[i] = (long long) inv[i + 1] * (i + 1) % P;

  }

  for (int i = 1; i <= n; ++i) {

    f1[n - i] = (long long) a[i] * fac[i] % P;

  }

  for (int i = 0; i <= n - 1; ++i) {

    f2[i] = inv[i];

  }

  calc();

  for (int i = n - 1; i >= 0; --i) {

    printf("%lld\n", (long long) f1[i] * inv[n - i] % P);

  }                  

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.588281985794442x):
#include <iostream> 

#include <cstdio> 

#include <cstdlib> 

#include <cstring> 

#include <cmath> 

#include <algorithm> 

using namespace std; 

inline int gi() {

    register int data = 0, w = 1;

    register char ch = 0;

    while (!isdigit(ch) && ch != '-') ch = getchar(); 

    if (ch == '-') w = -1, ch = getchar(); 

    while (isdigit(ch)) data = 10 * data + ch - '0', ch = getchar(); 

    return w * data; 

} 

const int Mod = 924844033, G = 5; 

int fpow(int x, int y) { 

	int res = 1; 

	while (y) { 

		if (y & 1) res = 1ll * res * x % Mod; 

		x = 1ll * x * x % Mod; 

		y >>= 1; 

	} 

	return res; 

} 

const int iG = fpow(G, Mod - 2); 

const int MAX_N = 2e5 + 5; 

int Limit, rev[MAX_N << 2]; 

void FFT_prepare(int len) { 

	int p = 0; 

	for (Limit = 1; Limit <= len; Limit <<= 1) ++p; 

	for (int i = 1; i < Limit; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (p - 1)); 

} 

void NTT(int *p, int op) { 

	for (int i = 1; i < Limit; i++) if (i < rev[i]) swap(p[i], p[rev[i]]); 

	for (int i = 1; i < Limit; i <<= 1) { 

		int rot = fpow(op == 1 ? G : iG, (Mod - 1) / (i << 1)); 

		for (int j = 0; j < Limit; j += i << 1) 

			for (int k = 0, w = 1; k < i; k++, w = 1ll * w * rot % Mod) { 

				int x = p[j + k], y = 1ll * w * p[i + j + k] % Mod; 

				p[j + k] = (x + y) % Mod, p[i + j + k] = (x - y + Mod) % Mod; 

			} 

	} 

	if (!op) { 

		int inv = fpow(Limit, Mod - 2); 

		for (int i = 0; i < Limit; i++) p[i] = 1ll * p[i] * inv % Mod; 

	} 

} 

struct Graph { int to, next; } e[MAX_N << 1]; 

int fir[MAX_N], e_cnt; 

void clearGraph() { memset(fir, -1, sizeof(fir)); e_cnt = 0; } 

void Add_Edge(int u, int v) { e[e_cnt] = (Graph){v, fir[u]}, fir[u] = e_cnt++; } 

int N, f[MAX_N << 2], g[MAX_N << 2], h[MAX_N << 2];

int siz[MAX_N], cnt[MAX_N]; 

void dfs(int x, int fa) { 

	siz[x] = 1; 

	for (int i = fir[x]; ~i; i = e[i].next) {

		int v = e[i].to; if (v == fa) continue; 

		dfs(v, x), siz[x] += siz[v]; 

		cnt[siz[v]]++; 

	} 

	cnt[N - siz[x]]++; 

} 

int fac[MAX_N], ifc[MAX_N]; 

int C(int n, int m) { 

	if (n < 0 || m < 0 || n < m) return 0; 

	else return 1ll * fac[n] * ifc[n - m] % Mod * ifc[m] % Mod; 

} 

int main () { 

	clearGraph(); 

	N = gi(); 

	for (int i = 1; i < N; i++) { 

		int u = gi(), v = gi(); 

		Add_Edge(u, v), Add_Edge(v, u); 

	} 

	fac[0] = 1; for (int i = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % Mod; 

	ifc[N] = fpow(fac[N], Mod - 2); 

	for (int i = N - 1; ~i; i--) ifc[i] = 1ll * ifc[i + 1] * (i + 1) % Mod;

	dfs(1, 0); 

	for (int i = 1; i <= N; i++) g[i] = 1ll * cnt[i] * fac[i] % Mod; 

	for (int i = 0; i <= N; i++) h[i] = ifc[i]; 

	reverse(&g[0], &g[N + 1]); 

	FFT_prepare(N << 1); 

	NTT(g, 1), NTT(h, 1); 

	for (int i = 0; i < Limit; i++) f[i] = 1ll * g[i] * h[i] % Mod; 

	NTT(f, 0); 

	for (int i = 1; i <= N; i++) { 

		int ans = 1ll * N * C(N, i) % Mod; 

		ans = (ans - 1ll * ifc[i] * f[N - i] % Mod + Mod) % Mod; 

		printf("%d\n", ans); 

	} 

    return 0; 

}