//Priyanshu Kumar : IIIT Allahabad
#include<bits/stdc++.h>
using namespace std;

#define ll long long int
#define MAX 100005
#define MOD 1000000007
#define sz size()
#define ln length()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define si(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define pi(n) printf("%d",n)
#define pin(n) printf("%d\n",n);
#define pl(n) printf("%lld",n)
#define pln(n) printf("%lld\n",n);
#define FUCK_YEAH ios_base::sync_with_stdio(false);cin.tie(NULL)
inline ll gcd(ll x,ll y){return x%y==0?y:gcd(y,x%y);}
inline ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
inline ll powmod(ll a,ll b,ll mod) 
{
	ll res=1;
	a%=mod; 
	assert(b>=0); 
	for(;b;b>>=1)
	{
		if(b&1)res=res*a%mod;
		a=a*a%mod;
	}
	return res;
}
inline ll mulmod(ll a, ll b, ll c)
{
	if(!b)return 0;
	ll x = mulmod(a, b/2, c);
	if (b & 1)return (x+x+a)%c;
	return (x+x)%c;
}

int main()
{
	FUCK_YEAH;
	ll n,k,x;
	cin >> n >> k >> x;
	ll dp[n][2];
	dp[0][0] = 0;
	dp[0][1] = 1;
	for(int i=1;i<n-2;i++) {
		dp[i][0] = (powmod(k-1,i,MOD) - dp[i-1][0] + MOD)%MOD;
		dp[i][1] = (powmod(k-1,i,MOD) - dp[i-1][1] + MOD)%MOD;
	}
	ll ans = 0;
	for(int i=1;i<=k;i++) {
		if(x != i) {
			if(i == 1) {
				ans = (ans + dp[n-3][0])%MOD;
			}
			else {
				ans = (ans + dp[n-3][1])%MOD;
			}
		}
	}
	cout << ans <<endl;
	return 0;
}