#include <bits/stdc++.h>

using namespace std;

long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    long long dp[100001][2];
    memset(dp,0,sizeof(dp));
    int mod = 1000000007;
    if (1==x){
        dp[0][0] = 1;
    }else{
        dp[0][1] = 1;
        //cout<<dp[0][1]<<endl;
    }
    for(int i=1;i<n;i++){
        dp[i][0] = dp[i-1][1];
        dp[i][1] =  (dp[i-1][0] *( k-1) + dp[i-1][1]*(k-2) ) % mod;
        //cout<<"i:"<<i<<" "<<dp[i][0]<< " "<<dp[i][1]<<endl;
    }
    return dp[n-1][0];
    
}

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