#include <bits/stdc++.h>

using namespace std;

long MOD = 1e9+7;

long countArray(long n, long k, long x) {
    // Return the number of ways to fill in the array.

    vector<vector<long>> dp(n-2, vector<long>(2));
    
    dp[0][0] = (x==1 ? k-1 : k-2);
    dp[0][1] = (x==1 ? 0 : 1);
    
    for(int i=1; i<dp.size(); ++i) {
        dp[i][0] = (dp[i-1][0]*(k-2)+dp[i-1][1]*(k-1))%MOD;
        dp[i][1] = dp[i-1][0];
    }
    
    
    return dp.back()[0];
}

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