#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#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;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

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, K;
    cin >> N >> M >> K;
    vector dp(M + 2, vector<mint>(M + 2));
    dp[0][0] = 1;
    const int L = 400;
    vector p(L, vector<mint>(L));
    rep(i, 0, L){
        p[i][0] = 1;
        rep(j, 1, L) p[i][j] = p[i][j - 1] * i;
    }
    rep(i, 0, M + 1) rep(j, 0, M + 1) if (dp[i][j].val() != 0) rep(k, i + 1, M + 2){
        if (k == i + 1){
            // cout << i << " " << j << " " << dp[i][j].val() << "\n";
        }
        mint tmp = dp[i][j];
        tmp *= p[k][min(K, k) - min(i, K)];
        dp[k][j + k - i - 1] += tmp;
    }
    vector<mint> dp2(M + 1);
    dp2[0] = 1;
    rep(i, 0, N){
        vector<mint> ndp2(M + 1);
        rep(j, 0, M + 1){
            if (j != M) ndp2[j + 1] += dp2[j] * (j + 1);
            ndp2[j] += dp2[j] * j;
        }
        swap(ndp2, dp2);
    }
    mint ans = 0;
    rep(i, 0, M + 1){
        ans += dp2[i] * dp[M + 1][i];
    }
    cout << ans.val() << "\n";
}