#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector< vector<int> > VVI;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()

int main(){
  int H,W,K;
  cin>>H>>W>>K;
  ll mod=1e9+7;
  ll dp[H+1][W]={};
  dp[0][0]=1;
  ll L[W]={};
  ll M[W]={};
  ll R[W]={};
  if(W>1) rep(i,(1<<(W-1))){
    int F=1;
    rep(j,W-2) if((i&(1<<j))&&(i&(1<<(j+1)))) F=0;
    if(F) rep(j,W-1){
      if(i&(1<<j)){
        R[j]++;
        L[j+1]++;
      }
    }
    if(F) rep(j,W){
      if(j==0){
        if((i&(1<<j))==0) M[j]++;
      }else if(j==W-1){
        if((i&(1<<(j-1)))==0) M[j]++;
      }else{
        if((i&(1<<(j-1)))==0&&(i&(1<<j))==0) M[j]++;
      }
    }
  }
  rep(i,H){
    rep(j,W){
      if(j==0) dp[i+1][j]=(dp[i][j]*M[j]+dp[i][j+1]*R[j])%mod;
      else if(j==W-1) dp[i+1][j]=(dp[i][j]*M[j]+dp[i][j-1]*L[j])%mod;
      else dp[i+1][j]=(dp[i][j]*M[j]+dp[i][j+1]*R[j]+dp[i][j-1]*L[j])%mod;
    }
  }
  if(W==1) cout<<1<<endl;
  else cout<<dp[H][K-1]<<endl;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if(a < b) {a = b; return true;} return false;}
const ll INF = 1LL << 60;
const int MAX = 510000;
const ll MOD = 998244353;

ll fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
ll COM(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll binarypow(ll a, ll n, ll mod) {
  ll res = 1;
  while(n > 0) {
    if(n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

int main() {
    ll n, m, k; cin >> n >> m >> k;
    COMinit();
    ll ans = 0;
    rep(i, k+1) ans += COM(n-1, i) * m % MOD * binarypow(m-1, n-i-1, MOD) % MOD;
    cout << ans % MOD << endl;
}