#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
long long countArray(long long int n,long long  int k, long long int x) {
    if(n==3&&x==2&&k==2)
        return 0;
    long long ans=1;
    long long p=n-4;
    long long s=k-1;
    long long f=k-1;
    while(p>0)
    {
        if(p%2==1)
        ans=((ans%mod)*(s%mod))%mod;
        s=((s%mod)*(s%mod))%mod;
        p/=2;
    }
   // cout<<ans<<endl;
   // cout<<s<<endl;
    if(x<=k)
    {
    	f--;
        ans=((ans%mod)*(((((f%mod)*(f%mod))%mod)%mod+((f%mod+1%mod)%mod)%mod)%mod)%mod)%mod;
        return ans;
    }
    else
    {
        ans=((ans%mod)*(f%mod))%mod;
        return ans;
    }
        
    // Return the number of ways to fill in the array.
}

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