#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

const long int dv = (long int)(pow(10,9)+7);

long int countArray(int n, int k, int x) {
    // Return the number of ways to fill in the array.
    if(n == 3)
    {
        return k-2;
    }else if(n == 4)
    {
        long int temp = ((k-1)*(k-2))%dv;
        long int sum = ((k-1)*(k-1))%dv;
        return (temp + sum + 1)/2;
    }else
    {
       long int sum = k-1;
       for(int i = 0; i<n-4;i++)
       {
           sum = (sum * (k-1))% dv;
       }
       long int temp = sum;
        sum = (sum * (k-2))% dv;
        temp = (temp * (k-1))% dv;
        return (sum + temp +1)/2;
        
    }
}

int main() {
    int n; 
    int k; 
    int x; 
    scanf("%i %i %i", &n, &k, &x);
    long int answer = countArray(n, k, x);
    printf("%ld\n", answer);
    return 0;
}