#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}



template<class T>
using square_matrix=std::vector<std::vector<T>>;
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){
	int n=l.size();
	assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){
		val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));
	}
	return val;
}
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> pow_matrix(square_matrix<T> l,long long times){
	int n=l.size();
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) val[i][i]=mul_e();
	while(times){
		if(times&1){
			val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);
		}
		l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);
		times>>=1;
	}
	return val;
}

#include <atcoder/modint>
using mint = atcoder::modint998244353;
using mat_F=mint;
mat_F add_op(mat_F a,mat_F b){
	return (a+b);
}
mat_F add_e(){
	return 0;
}
mat_F mul_op(mat_F a,mat_F b){
	return (a*b);
}
mat_F mul_e(){
	return 1;
}
#define calc mat_F,add_op,add_e,mul_op,mul_e



void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, M, X;
    cin >> N >> M >> X;
    vector<vector<int>> G(N);
    vector<mint> inv(1010, 1);
    rep(i, 1, 1010) inv[i] = (mint)(1) / (mint)(i);
    rep(i, 0, M){
        int a, b;
        cin >> a >> b;
        a--, b--;
        G[a].push_back(b);
        if (a - b) G[b].push_back(a);
    }
    bool sel = 1;
    for (auto x : G[0]) if (x) sel = 0;
    if (sel){
        cout << "1\n";
        rep(i, 0, N - 1) cout << "0\n";
        return;
    }
    auto f = [&](int a, int b) -> int {
        return a * (N + 1) + b;
    };
    // (a, b)
    // a 一個前の頂点
    vector base(N * (N + 1), vector<mint>(N * (N + 1)));
    rep(i, 0, N){
        if (G[i].empty()){
            continue;
        }
        for (auto x : G[i]){
            base[f(i, N)][f(i, x)] += inv[G[i].size()];
        }
        rep(j, 0, N){
            int c = 0;
            for (auto x : G[i]) if (x == j) c++;
            if (c == 0) continue;
            bool ok = 0;
            for (auto x : G[i]){
                if (j == x && c != 0) c = 0;
                else ok = 1, base[f(j, i)][f(i, x)] += inv[G[i].size() - 1];
            }
            if (!ok){
                base[f(j, i)][f(i, N)] = 1;
            }
        }
    }
    auto ans = pow_matrix<calc>(base, X);
    rep(i, 0, N){
        mint sum = 0;
        rep(j, 0, N) sum += ans[f(0, N)][f(j, i)];
        sum += ans[f(0, N)][f(i, N)];
        cout << sum.val() << "\n";
    }
}