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

long long mod = 998244353;
//入力が必ずmod未満の時に使う.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a;} mint(long long a){v = a;} mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(const long long a,long long b){
        mint ret = 1,p = a;
        while(b){
            if(b&1) ret *= p;
            p *= p; b >>= 1;
        }
        return ret;
    };
 
    mint operator+(const mint b){return mint(v)+=b;}
    mint operator-(const mint b){return mint(v)-=b;}
    mint operator*(const mint b){return mint(v)*=b;}
    mint operator/(const mint b){return mint(v)/=b;}
 
    mint operator+=(const mint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    mint operator-=(const mint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    mint operator*=(const mint b){v = v*b.v%mod; return *this;}
    mint operator/=(mint b){
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
 
    mint operator++(int){*this += 1; return *this;}
    mint operator--(int){*this -= 1; return *this;}
    bool operator==(const mint b){return v == b.v;}
    bool operator!=(const mint b){return v != b.v;}
    bool operator>(const mint b){return v > b.v;}
    bool operator>=(const mint b){return v >= b.v;}
    bool operator<(const mint b){return v < b.v;}
    bool operator<=(const mint b){return v <= b.v;}
    
    mint pow(const long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};

vector<vector<mint>> multima(vector<vector<mint>> &A,vector<vector<mint>> &B){
    int siza = A.size(),sizb = B.at(0).size();
    vector<vector<mint>> ret(siza,vector<mint>(sizb));
    for(int i=0; i<siza; i++) for(int k=0; k<sizb; k++){
        for(int l=0; l<A.at(i).size(); l++){
            ret.at(i).at(k) += A.at(i).at(l)*B.at(l).at(k);
            //ret.at(i).at(k) %= mod;
        }
    }
    return ret;
    //計算できる行列のみ.
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M,X; cin >> N >> M >> X;
    int Limit = M;
    vector<long long> inv(Limit+1,1);
    for(int i=2; i<=Limit; i++) inv.at(i) = mod-(mod/i*inv.at(mod%i) %mod);

    vector<vector<int>> edge(N,vector<int>(N));
    while(M--){
        int u,v; cin >> u >> v;
        u--; v--;
        edge.at(u).at(v)++;
        if(u != v) edge.at(v).at(u)++;
    }

    int n = (N+1)*N;
    vector<vector<mint>> Z(n,vector<mint>(n)),A(n,vector<mint>(1));
    for(int i=0; i<=N; i++) for(int k=0; k<N; k++){
        vector<int> now = edge.at(k);
        if(i < N){
            now.at(i)--;
            if(now.at(i) < 0) continue;
        }
        int pos = i*N+k,all = 0;
        for(auto &e : now) all += e;
        if(all == 0) Z.at(n-N+k).at(pos) = 1;
        else for(int l=0; l<N; l++) Z.at(k*N+l).at(pos) = mint(now.at(l))*inv.at(all);
    }

    A.at(n-N+0).at(0) = 1;
    while(X){
        if(X&1) A = multima(Z,A);
        Z = multima(Z,Z); X >>= 1;
    }
    vector<mint> answer(N);
    for(int i=0; i<=N; i++) for(int k=0; k<N; k++){
        int pos = i*N+k;
        answer.at(k) += A.at(pos).at(0);
    }
    for(auto &a : answer) cout << a.v << "\n";
}