Problem:
Score : 500 points

Problem Statement

There are N blocks arranged in a row. Let us paint these blocks.

We will consider two ways to paint the blocks different if and only if there is a block painted in different colors in those two ways.

Find the number of ways to paint the blocks under the following conditions:

For each block, use one of the M colors, Color 1 through Color M, to paint it. It is not mandatory to use all the colors.

There may be at most K pairs of adjacent blocks that are painted in the same color.

Since the count may be enormous, print it modulo 998244353.

Constraints

All values in input are integers.

1 \leq N, M \leq 2 \times 10^5

0 \leq K \leq N - 1

Input

Input is given from Standard Input in the following format:

N M K

Output

Print the answer.

Sample Input 1

3 2 1

Sample Output 1

6

The following ways to paint the blocks satisfy the conditions: 112, 121, 122, 211, 212, and 221. Here, digits represent the colors of the blocks.

Sample Input 2

100 100 0

Sample Output 2

73074801

Sample Input 3

60522 114575 7559

Sample Output 3

479519525

Solution in Rust (1.42.0) (judge verdict: Runtime Error)

#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

use std::ops::*;
use std::fmt;

#[derive(Copy, Clone, PartialEq, Debug)]
struct ModInt(usize);

const MOD: usize = 998244353;
impl ModInt {
    fn pow(self, power: usize) -> Self {
        if power == 0 {
            return ModInt(1);
        }
        if power % 2 == 0 {
            let t = self.pow(power/2);
            return t * t;
        }
        self * self.pow(power-1)
    }

    fn inv(self) -> Self {
        self.pow(MOD - 2)
    }
}

impl Add for ModInt {
    type Output = Self;

    fn add(self, rhs: Self) -> Self {
        let mut tmp = self;
        tmp.0 += rhs.0;
        if tmp.0 >= MOD {
            tmp.0 -= MOD;
        }
        tmp
    }
}

impl AddAssign for ModInt {
    fn add_assign(&mut self, rhs: Self) {
        *self = *self + rhs;
    }
}

impl Sub for ModInt {
    type Output = Self;

    fn sub(self, rhs: Self) -> Self {
        let mut ret = self;
        if ret.0 < rhs.0 {
            ret.0 += MOD;
        }
        ret.0 -= rhs.0;
        ret
    }
}

impl SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: Self) {
        *self = *self - rhs;
    }
}

impl Mul for ModInt {
    type Output = Self;

    fn mul(self, rhs: ModInt) -> Self {
        let mut ret = self;
        ret.0 *= rhs.0;
        ret.0 %= MOD;
        ret
    }
}

impl MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: Self) {
        *self = *self * rhs;
    }
}

impl Div for ModInt {
    type Output = ModInt;

    fn div(self, rhs: ModInt) -> Self {
        let mut ret = self;
        ret.0 *= rhs.inv().0;
        ret.0 %= MOD;
        ret
    }
}

impl DivAssign for ModInt {
    fn div_assign(&mut self, rhs: Self) {
        *self = *self / rhs;
    }
}

impl fmt::Display for ModInt {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "{}", self.0)
    }
}

struct Com {
    n: usize,
    fac: Vec<ModInt>,
    finv: Vec<ModInt>,
}

impl Com {
    fn new(n: usize) -> Self {
        let mut ret = Com {
            n: n,
            fac: vec![ModInt(0); n+1],
            finv: vec![ModInt(0); n+1],
        };
        ret.com_init();
        ret
    }
    fn com_init(&mut self) {
        self.fac[0] = ModInt(1);
        self.fac[1] = ModInt(1);
        self.finv[0] = ModInt(1);
        for i in 2..self.n+1 {
            self.fac[i] = self.fac[i-1] * ModInt(i);
        }
        self.finv[self.n] = self.fac[self.n].inv();
        for i in (2..self.n+1).rev() {
            self.finv[i-1] = self.finv[i] * ModInt(i);
        }
    }
    fn com(&self, n: usize, k: usize) -> ModInt {
        if n < k {
            return ModInt(0);
        }
        self.fac[n] * self.finv[k] * self.finv[n - k]
    }
}

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let M: usize = sc.get();
    let K: usize = sc.get();
    let com = Com::new(N-1);
    let mut ans = ModInt(0);
    for k in 0..=K {
        ans += com.com(N-1, k) * ModInt(M) * ModInt(M-1).pow(N-k-1);
    }
    println!("{}", ans);
}