#include <bits/stdc++.h>
using namespace std;

const int kMod = 1000000007;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, K, X;
    cin >> N >> K >> X;
    long res = 0;
    vector<long> lastX(N, 0), lastNonX(N, 0);
    if (X == 1) {
        lastX[0] = 1;
    } else {
        lastNonX[0] = 1;
    }
    for(int i=1; i<N; ++i) {
        lastX[i] = lastNonX[i-1];
        lastNonX[i] = (lastX[i-1]*(K-1) + lastNonX[i-1]*(K-2))%kMod;
    }
    cout << lastX[N-1] << endl;
    return 0;
}