#!/bin/python

import sys

def countArray(n, k, x):
    # Return the number of ways to fill in the array.
    #i=0
    #ans=1
    #while i<n-2:
    #    ans*=k-1
    #    i+=1
    #ans/=k-1
    #ans*=k-2
    i=2
    ans2=1
    while i<n-2:
        ans2*=k-1
        i+=1
    ans2=ans2*(k-2)*(k-2) + ans2*(k-1)
    return ans2

if __name__ == "__main__":
    n, k, x = raw_input().strip().split(' ')
    n, k, x = [int(n), int(k), int(x)]
    answer = countArray(n, k, x)
    print answer