import sys, re

from collections import deque, defaultdict, Counter

from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd

from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby

from operator import itemgetter, mul

from copy import deepcopy

from string import ascii_lowercase, ascii_uppercase, digits

from bisect import bisect, bisect_left

from heapq import heappush, heappop

from functools import reduce

def input(): return sys.stdin.readline().strip()

def INT(): return int(eval(input()))

def MAP(): return list(map(int, input().split()))

def LIST(): return list(map(int, input().split()))

def ZIP(n): return list(zip(*(MAP() for _ in range(n))))

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

mod =  998244353



def power(x, n, p):

	ans = 1

	while n:

		if n%2:

			ans = ans*x%p

		x = x*x%p

		n >>= 1

	return ans



lim = 2*10**5

fact = [1]*(lim+1)

for n in range(1, lim+1):

	fact[n] = n*fact[n-1]%mod



fact_inv = [1]*(lim+1)

fact_inv[lim] = power(fact[lim], mod-2, mod)

for n in range(lim, 0, -1):

	fact_inv[n-1] = n*fact_inv[n]%mod



def C(n, r):

	return (fact[n]*fact_inv[r]%mod)*fact_inv[n-r]%mod





N, M, K = MAP()



ans = 0

for i in range(K+1):

	a = M*power(M-1, N-1-i, mod)%mod*C(N-1, i)%mod

	ans = (ans+a)%mod



print(ans)

import sys, re

from collections import deque, defaultdict, Counter

from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd

from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby

from operator import itemgetter, mul

from copy import deepcopy

from string import ascii_lowercase, ascii_uppercase, digits

from bisect import bisect, bisect_left

from heapq import heappush, heappop

from functools import reduce

def input(): return sys.stdin.readline().strip()

def INT(): return int(eval(input()))

def MAP(): return list(map(int, input().split()))

def LIST(): return list(map(int, input().split()))

def ZIP(n): return list(zip(*(MAP() for _ in range(n))))

sys.setrecursionlimit(10 ** 9)

INF = float('inf')

mod =  998244353



lim = 2*10**5

fact = [1]*(lim+1)

for n in range(1, lim+1):

	fact[n] = n*fact[n-1]%mod



fact_inv = [1]*(lim+1)

fact_inv[lim] = pow(fact[lim], mod-2, mod)

for n in range(lim, 0, -1):

	fact_inv[n-1] = n*fact_inv[n]%mod



def C(n, r):

	return (((fact[n]*fact_inv[r])%mod)*fact_inv[n-r])%mod





N, M, K = MAP()



ans = 0

for i in range(K+1):

	ans += M*pow(M-1, N-1-i, mod)%mod*C(N-1, i)

	ans %= mod 



print(ans)

import sys, re
from collections import deque, defaultdict, Counter
from math import (
    ceil,
    sqrt,
    hypot,
    factorial,
    pi,
    sin,
    cos,
    tan,
    asin,
    acos,
    atan,
    radians,
    degrees,
    log2,
    gcd,
)
from itertools import (
    accumulate,
    permutations,
    combinations,
    combinations_with_replacement,
    product,
    groupby,
)
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce


def input():
    return sys.stdin.readline().strip()


def INT():
    return int(eval(input()))


def MAP():
    return list(map(int, input().split()))


def LIST():
    return list(map(int, input().split()))


def ZIP(n):
    return list(zip(*(MAP() for _ in range(n))))


sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 998244353


def power(x, n, p):
    ans = 1
    while n:
        if n % 2:
            ans = ans * x % p
        x = x * x % p
        n >>= 1
    return ans


lim = 2 * 10**5
fact = [1] * (lim + 1)
for n in range(1, lim + 1):
    fact[n] = n * fact[n - 1] % mod
fact_inv = [1] * (lim + 1)
fact_inv[lim] = power(fact[lim], mod - 2, mod)
for n in range(lim, 0, -1):
    fact_inv[n - 1] = n * fact_inv[n] % mod


def C(n, r):
    return (fact[n] * fact_inv[r] % mod) * fact_inv[n - r] % mod


N, M, K = MAP()
ans = 0
for i in range(K + 1):
    a = M * power(M - 1, N - 1 - i, mod) % mod * C(N - 1, i) % mod
    ans = (ans + a) % mod
print(ans)

import sys, re
from collections import deque, defaultdict, Counter
from math import (
    ceil,
    sqrt,
    hypot,
    factorial,
    pi,
    sin,
    cos,
    tan,
    asin,
    acos,
    atan,
    radians,
    degrees,
    log2,
    gcd,
)
from itertools import (
    accumulate,
    permutations,
    combinations,
    combinations_with_replacement,
    product,
    groupby,
)
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce


def input():
    return sys.stdin.readline().strip()


def INT():
    return int(eval(input()))


def MAP():
    return list(map(int, input().split()))


def LIST():
    return list(map(int, input().split()))


def ZIP(n):
    return list(zip(*(MAP() for _ in range(n))))


sys.setrecursionlimit(10**9)
INF = float("inf")
mod = 998244353
lim = 2 * 10**5
fact = [1] * (lim + 1)
for n in range(1, lim + 1):
    fact[n] = n * fact[n - 1] % mod
fact_inv = [1] * (lim + 1)
fact_inv[lim] = pow(fact[lim], mod - 2, mod)
for n in range(lim, 0, -1):
    fact_inv[n - 1] = n * fact_inv[n] % mod


def C(n, r):
    return (((fact[n] * fact_inv[r]) % mod) * fact_inv[n - r]) % mod


N, M, K = MAP()
ans = 0
for i in range(K + 1):
    ans += M * pow(M - 1, N - 1 - i, mod) % mod * C(N - 1, i)
    ans %= mod
print(ans)

- - -def power(x, n, p): -    ans = 1 -    while n: -        if n % 2: -            ans = ans * x % p -        x = x * x % p -        n >>= 1 -    return ans - - -fact_inv[lim] = power(fact[lim], mod - 2, mod) +fact_inv[lim] = pow(fact[lim], mod - 2, mod) -    return (fact[n] * fact_inv[r] % mod) * fact_inv[n - r] % mod +    return (((fact[n] * fact_inv[r]) % mod) * fact_inv[n - r]) % mod -    a = M * power(M - 1, N - 1 - i, mod) % mod * C(N - 1, i) % mod -    ans = (ans + a) % mod +    ans += M * pow(M - 1, N - 1 - i, mod) % mod * C(N - 1, i) +    ans %= mod