#include <iostream>

#define MOD (int)(1e9+7)

using namespace std;

long findWays(long, long);
int main()
{
    long n, k, x;
    cin >> n >> k >> x;
    long ans = k;

    for (int i = 0; i < n-3; i++)
        ans = (ans*(k-1)) % MOD;

    ans -= 2*(k-1) - 1;
    cout << ans << endl;
    
    return 0;
}