#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}


template <unsigned int mod>
class ModInt {
private:
    unsigned int v;
    static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
    static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
    static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
    static unsigned int inverse(int a, int m){
        int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
        while(*v){
            t = *u / *v;
            swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
        }
        return (u[1] % m + m) % m;
    }

public:
    ModInt() : v{0}{}
    ModInt(const long long val) : v{norm(val % mod + mod)} {}
    ModInt(const ModInt<mod>& n) : v{n()} {}
    explicit operator bool() const noexcept { return v != 0; }
    bool operator!() const noexcept { return !static_cast<bool>(*this); }
    ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
    ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
    ModInt operator+() const { return *this; }
    ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
    ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
    ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
    ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
    ModInt operator/(const ModInt& val) const { return *this * inv(val); }
    ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
    ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
    ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
    ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
    ModInt operator+(const long long val) const { return ModInt{v + val}; }
    ModInt operator-(const long long val) const { return ModInt{v - val}; }
    ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
    ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
    ModInt& operator+=(const long long val){ return *this = *this + val; }
    ModInt& operator-=(const long long val){ return *this = *this - val; }
    ModInt& operator*=(const long long val){ return *this = *this * val; }
    ModInt& operator/=(const long long val){ return *this = *this / val; }
    bool operator==(const ModInt& val) const { return v == val.v; }
    bool operator!=(const ModInt& val) const { return !(*this == val); }
    bool operator==(const long long val) const { return v == norm(val % mod + mod); }
    bool operator!=(const long long val) const { return !(*this == val); }
    unsigned int operator()() const { return v; }
    friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
    friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
    friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
    friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
    friend bool operator==(const long long val, const ModInt& n) { return n == val; }
    friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
    friend istream& operator>>(istream& is, ModInt& n){
        unsigned int v;
        return is >> v, n = v, is;
    }
    friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
    friend ModInt mod_pow(ModInt x, long long n){
        ModInt ans = 1;
        while(n){
            if(n & 1) ans *= x;
            x *= x, n >>= 1;
        }
        return ans;
    }
};

#define MOD 924844033
#define root 5

int add(const int x, const int y) { return (x + y < MOD) ? x + y : x + y - MOD; }
int mul(const int x, const int y) { return (long long)x * y % MOD; }
int power(int x, int n)
{
    int res = 1;
    while(n > 0) {
        if (n & 1) { res = mul(res, x); }
        x = mul(x, x);
        n >>= 1;
    }
    return res;
}
int inverse(const int x) { return power(x, MOD - 2); }

void ntt(vector<int>& a, const bool rev = false)
{
    int i,j,k,s,t,v,w,wn;
    const int size = (int)a.size();
    const int height = (int)log2(2 * size - 1);
    for(i = 0; i < size; i++) {
        j = 0;
        for(k = 0; k < height; k++) { j |= (i >> k & 1) << (height - 1 - k); }
        if(i < j) swap(a[i], a[j]);
    }
    for(i = 1; i < size; i *= 2) {
        w = power(root, (MOD - 1) / (i * 2));
        if(rev) w = inverse(w);
        for(j = 0; j < size; j += i * 2) {
            wn = 1;
            for(k = 0; k < i; k++) {
                s = a[j + k + 0], t = mul(a[j + k + i], wn);
                a[j + k + 0] = add(s, t);
                a[j + k + i] = add(s, MOD - t);
                wn = mul(wn, w);
            }
        }
    }
    if(rev){
        v = inverse(size);
        for (i = 0; i < size; i++) { a[i] = mul(a[i], v); }
    }
}

vector<int> convolute(const vector<int>& a, const vector<int>& b)
{
    const int size = (int)a.size() + (int)b.size() - 1;
    int t = 1;
    while (t < size) { t <<= 1; }
    vector<int> A(t, 0), B(t, 0);
    for (int i = 0; i < (int)a.size(); i++) { A[i] = a[i]; }
    for (int i = 0; i < (int)b.size(); i++) { B[i] = b[i]; }
    ntt(A), ntt(B);
    for (int i = 0; i < t; i++) { A[i] = mul(A[i], B[i]); }
    ntt(A, true);
    A.resize(size);
    return A;
}

using mod = ModInt<MOD>;

#define MAX_N 200010
mod inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;i++){
        inv[i] = MOD - inv[MOD % i] * (MOD / i);
        fac[i] = fac[i-1] * i;
        finv[i] = finv[i-1] * inv[i];
    }
}

mod comb(int a, int b)
{
    if(a<b) return 0;
    return fac[a] * finv[b] * finv[a-b];
}


vector<vector<int> > g;
int n;
vector<int> res;


int dfs(int id,int pre){
    int tmp = 0;
    for(auto x:g[id]){
        if(x==pre)continue;
        int k = dfs(x,id);
        tmp += k;
        res[k]++;
        res[n-k]++;
    }
    return tmp+1;
}

int main(){
    make();
    cin >> n;
    g.resize(n);
    res.resize(n);
    rep(i,n-1){
        int a,b;
        cin >> a >> b;
        a--;b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    dfs(0,0);
    vector<mod> p(n);
    rep(i,n){
        p[i] = fac[i] * res[i];
    }
    vector<int> a(n),b(n);
    rep(i,n){
        a[i] = p[i]();
        b[n-1-i] = finv[i]();
    }
    auto x = convolute(a,b);
    for(int i=1;i<=n;i++){
        cout << (comb(n,i)*(n)-finv[i]*x[n-1+i]) << "\n";
    }
    return 0;
}

Measured memory_bytes: 28672