#!/bin/python3

import sys

def countArray(n, k, x):
    # Return the number of ways to fill in the array.
    if x==1:
        if n%2!=0:
            ans=(k-2)**2*(k-1)**(n-4)+(k-1)**(n-3)
        else:
            ans=(k-1)**(n-3)*(k-2)
    else:
        if n%2!=0:
            ans=(k-2)**(n-2)+2*(k-1)**(n-3)
        else:
            ans=(k-2)**(n-2)+(k-1)**(n-3)
    
    return ans    

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)