import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long countArray(int n, int k, int x) {
        // Return the number of ways to fill in the array.
        long mod = 1000000007;
        long[][] dp = new long[n+1][2];
        
       
        
        if(x!=1)
        dp[1][0]=1;
        else dp[1][1]=1;
        
        for(int i=2;i<n;i++){
        
             dp[i][1]+=dp[i-1][0];
            
             long ways = dp[i-1][0]*(k-1);
             ways%=mod;
          
             dp[i][0] = (ways-dp[i-1][0]+mod)%mod;
             dp[i][0]+= (dp[i-1][1]*(k-1))%mod;
             dp[i][0]%=mod;
             
        }
      
        return dp[n-1][0];
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int x = in.nextInt();
        long answer = countArray(n, k, x);
        System.out.println(answer);
        in.close();
    }
}