#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL
struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};
combi C(500005);


int main(){
	
	int N,M,E;
	cin>>N>>M>>E;
	
	rep(i,N){
		mint ans = 0;
		rep(j,1000000){
			if(j==0){
				if(M-1-i>=0)ans += (mint(N-i-1)*mint(N-i).inv()).pow(M-1-i);
				else ans++;
				continue;
			}
			long long rem = M-1;
			rem -= j;
			rem -= (long long)j * i;
			if(rem < 0)break;
			mint v = mint(N-i).inv().pow(j);
			v *= mint(j+1).pow(E);
			mint sum = 0;
			mint p = mint(N-i-1)*((mint(N-i)).inv());
			rep(k,i+1){
				if(rem < k)break;
				if(k==i){
					sum += v * p.pow(rem-k) * C.junretsu(j, rem-k);
				}
				else{
					sum += v * p.pow(rem-k) * C.junretsu(j-1, rem-k);
				}
				
			}
			ans += sum;
		}
		cout<<ans.val()<<endl;
	}
	
	return 0;
}