#include <bits/stdc++.h>

using namespace std;

long long fast(long long a, long long b, long long pr=1000000007)
{
	if (b == 0)
		return 1 % pr;
	long long ans = 1 % pr;
	while (b)
	{
		if (b & 1)
		{
			ans *= a;
			ans %= pr;
		}
		b >>= 1;
		a *= a;
		a %= pr;
	}
	return ans;
}
#define ve vector
#define mod 1000000007
long countArray(long long int n,long long int k,long long int x) 
{
    ve<ve<long long> > dp(n+1,ve<long long>(2));
    dp[0][0]=(x!=1);
    dp[0][1]=(x==1);
    for(int i=1;i<n;i++)
    {
        if(i==1)
        {
            dp[i][0] = (dp[i-1][0]*(k-2)+dp[i-1][1]*(k-1))%mod;
            dp[i][1] = x==1?0:dp[i-1][0];
            continue;
        }
        dp[i][0]= (dp[i-1][0]*(k-2)+dp[i-1][1]*(k-1))%mod;
        dp[i][1]= dp[i-1][0];
    }
    return dp[n-1][1];
}

int main() {
    int n;
    int k;
    int x;
    cin >> n >> k >> x;
    long answer = countArray(n, k, x);
    cout << answer << endl;
    return 0;
}