#!/bin/python3

import sys    

def countArray(n, k, notLast):
    if(n<=1):
        return 1
    sum1=0
    sum1+=pow(k-1,n)
    sum1-=countArray(n-1,k,notLast)
    return sum1
    
    # Return the number of ways to fill in the array.

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