#!/bin/python3

import sys

def countArray(n, k, x):
    # Return the number of ways to fill in the array.
    prevx = 1 if x == 1 else 0
    notx = 1 - prevx
    for _ in range(n-3):
        prevx, notx = notx, (prevx*(k-1) + notx*(k-2)) % 1000000007 
    
    return (prevx*(k-1) + notx*(k-2)) % 1000000007

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)