#include <bits/stdc++.h>

using namespace std;
long mod=1000000007;
long countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    if(x<=k)
    {
        
        
        long sum=1;
        long t=0;
        for(int i=0;i<n-1;i++)
        {
            t=sum;
            sum=(sum*(k-1))%mod;
           
        }
        int y=mod-2;
        long p=k-1;
        long res=1;
        while(y>0)
        {
            if(y%2==1)
                res=(res*p)%mod;
            p=(p*p)%mod;
            y=y/2;
        }
        long one=0;
        long baki=(sum*res)%mod;
        for(int i=1;i<n-1;i++)
        {
            one =baki;
            baki=((sum-baki)*res)%mod;
        }
        while(one<0)
            one=one+mod;
        one=one%mod;
        while(baki<0)
            baki+=mod;
        baki=baki%mod;
       if(x==1)
           return one;
        
        
        return baki;
        
    }
    return 0;
}

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