#include <bits/stdc++.h>


using namespace std;

long countArray(int n, int k, int x) {
    if(n==3){
        if(x==1) return (k-1);
        else return (k-2);
    }
    return ((((n-3)%(1000000007)*(k-1)%(1000000007))%(1000000007))+(((k-2)%(1000000007)*(k-1)%(1000000007))/2)%(1000000007));
    // Return the number of ways to fill in the array.
}

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