//raja1999
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip> 
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 <<endl;prints xxx77
//setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx


using namespace std;
#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define ll long long
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (1000*1000*1000+5)
//#define iinf (3000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000*1000*1000+7)
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >

//std::ios::sync_with_stdio(false);
ll power(int a,int b){
	ll res=1,base=a;
	while(b>0){
		if(b%2){
			res*=base;
		}
		res%=mod;
		base*=base;
		base%=mod;
		b/=2;
	}
	return res;
}
ll dp[100005][2][2];
int n,k,x;
ll compute(int x,int fl,int prev){
	if(x==n-2){
		if(fl==1){
			return 0;
		}
		else{
			if(prev==1){
				return k-1;
			}
			else{
				return k-2;
			}
		}
	}
	if(dp[x][fl][prev]!=0){
		return dp[x][fl][prev];
	}
	if(fl==0){
		if(prev==0){
			dp[x][fl][prev]=k-2;
			dp[x][fl][prev]*=(compute(x+1,0,0)+compute(x+1,1,0));
			dp[x][fl][prev]%=mod;
			//cout<<dp[x][fl][prev]<<" "<<x<<endl;
		}
		else{
			dp[x][fl][prev]=k-1;
			dp[x][fl][prev]*=(compute(x+1,0,0)+compute(x+1,1,0));
			dp[x][fl][prev]%=mod;
		}
		return dp[x][fl][prev];
	}
	else{
		if(prev==0){
			dp[x][fl][prev]=1;
		 dp[x][fl][prev]*=compute(x+1,0,1)+compute(x+1,1,1);
		 dp[x][fl][prev]%=mod;
		}
		else{
			dp[x][fl][prev]=0;
		}
		return dp[x][fl][prev];
	}
}
int main(){
	std::ios::sync_with_stdio(false);
	int fl=0;
	cin>>n>>k>>x;
	if(x==1){
		fl=1;
	}
	ll ans=0;
	ans+=compute(1,0,fl);
	//cout<<ans<<endl;
	ans+=compute(1,1,fl);
	ans%=mod;
	cout<<ans<<endl;
}