#!/bin/python3

import sys

def countArray(n, k, x):
    # Return the number of ways to fill in the array.
    if n == 3:
        if x != 1:
            if k > x:
                return k-2
            if k < x:
                return k-1
        elif x == 1:
            return k-1
    elif n == 4:
        if k > x:
            return (k-1) * (k-1) -1
        else:
            return (k-1) * (k) -1
    else:
        if k > x:
            temp = (k-1) * (k-2)
        else:
            temp = (k-1) * (k-1)
            for i in range(3,n-1):
                temp = temp * (k-1)
        return temp
if __name__ == "__main__":
    n, k, x = input().strip().split(' ')
    n, k, x = [int(n), int(k), int(x)]
    answer = countArray(n, k, x)
    print(answer)