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

long countArray(int n, int k, int x) {
    long ans=1, p=1;
    for (int i=2; i<n; i++) {
        p = p*(k-1) % mod;
        ans = (p - ans + mod) % mod;
    }
    if(x==1) return n%2==0? ans-1:ans+1;
    return ans;
}

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