text: #include<cstdio>
  #include<algorithm>
  #include<cstring>
  #include<iostream>
  #include<vector>
  #include<queue>
  #include<cmath>
  #include<map>
  #include<set>
  #define ll long long
  #define F(i,a,b) for(int i=(a);i<=(b);i++)
  #define mst(a,b) memset((a),(b),sizeof(a))
  #define PII pair<int,int>
  using namespace std;
  template<class T>inline void read(T &x) {
    x=0; int ch=getchar(),f=0;
    while(ch<'0'||ch>'9'){if (ch=='-') f=1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    if(f)x=-x;
  }
  const int inf=0x3f3f3f3f;
  const int maxn=2050;
  const ll p=998244353;
  int n,m,k;
  ll f[maxn][maxn];
  int main()
  {
    cin>>n>>m>>k;
    f[1][0]=m;
    for(int i=1;i<=n;i++)
    {
      for(int j=0;j<=min(k,i-1);j++)
      {
        f[i][j]=(f[i][j]+f[i-1][j]+f[i-1][j-1]*(m-1))%p;
      }
    }
    cout<<f[n][k]<<endl;
    return 0;
  }