#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define all(a) (a.begin(),a.end())
#define fi first
#define sc second
#define ort(x,y) (x+y)/2
#define endl '\n'
#define FAST ios_base::sync_with_stdio(false);
#define d1(x) cerr<<#x<<":"<<x<<endl;
#define d2(x,y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl;
#define d3(x,y,z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl;
#define N (int) (1e5+5)
#define M (int) ()
#define inf (int) (1e7)
#define p (1000000007)
#define heap priority_queue
#define mem(a,val) memset(a,val,sizeof(a))
#define y1 asdassa
typedef long long int lli;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
int n,k,x;
int fast_pow(int n,int k)
{
	if(k==0) return 1;
	int re=fast_pow(n,k/2);
	re=1ll*re*re%p;
	if(k%2)
		re=1ll*re*n%p;
	return re;
}
int dfs(int n)
{
	if(n==1) return 0;
	if(n==2) return x!=1;
	return (1ll*fast_pow(k-1,n-2)-dfs(n-1)+p)%p;
}
int main()
{
	scanf("%d %d %d",&n,&k,&x);
	printf("%d\n",dfs(n));
}