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) {
        long sth=Math.round(Math.pow(k-1,n-1));
        if(x!=n)
        return ((sth+1)/(long)k)% Math.round((Math.pow(10,9))+7);
        else
            return (((sth+1)/(long)k)-1)% Math.round((Math.pow(10,9))+7);
        
        
        
        
        // Return the number of ways to fill in the array.
    }

    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();
    }
}