#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 int ans=0;
    for(int i=2;i<=k;i++){
        long int sum=1;
        if(i==2&&n%2==0)sum+=1;
        else if(i==2&&n%2!=0)sum+=0;
        else{
            for(int j=1;j<n-3;j++){
                sum=sum*(i-1);sum=sum%1000000007;
            }
            sum=sum*(i-2);
        }
        ans=ans+sum;
        ans=ans%1000000007;
    }
    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;
}