from math import gcd
N, M, K = map(int, input().split())
mod = 998244353
g = gcd(M, K)
if N == 1 :
    print(0)
    exit()
if (M - 1) % mod == 0 :
    ans = 0
    if N & 1 :
        ans = 1
    else :
        ans = mod - 1
    ans = (ans * (g - 1)) % mod
    print(ans)
else :
    X = pow(M - 1, N - 1, mod)
    iv = pow(M - 1, -1, mod)
    n = N - 2
    mat = [[mod - iv, (g * iv) % mod], [0, 1]]
    ret = [[1, 0], [0, 1]]
    while n > 0 :
        if n & 1 :
            ret2 = [[0, 0], [0, 0]]
            for i in range(2) :
                for j in range(2) :
                    for k in range(2) :
                        ret2[i][j] += ret[i][k] * mat[k][j]
                        ret2[i][j] %= mod
            for i in range(2) :
                for j in range(2) :
                    ret[i][j] = ret2[i][j]
        n >>= 1
        ret2 = [[0, 0], [0, 0]]
        for i in range(2) :
            for j in range(2) :
                for k in range(2) :
                    ret2[i][j] += mat[i][k] * mat[k][j]
                    ret2[i][j] %= mod
        for i in range(2) :
            for j in range(2) :
                mat[i][j] = ret2[i][j]
    b = (g - 1) * iv
    b %= mod
    bn = b * ret[0][0] + ret[0][1]
    bn %= mod
    bn = (bn * pow(M - 1, N - 1, mod)) % mod
    # print(bn)
    # print(X)
    print((X + mod - bn) % mod)