#!/bin/python3

import sys

def countArray(n, k, x):
    w = int((n-2)/2)*(k-1) + int((n-2)/2)*(k-2)
    if w > 10**9:
        return w%10**9 + 7
    return w
    # 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, k, x)
    print(answer)