#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <cassert>
#include <vector>
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define For( i , a ) for(int i=1;i<=a;i++)
#define ort (b+s)/2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset

using namespace std;

inline int read() {
    int res = 0 ;int neg ;
    while(true){char ch = getchar();if(ch>='0' && ch<='9' || ch=='-'){if(ch=='-') neg = -1;else neg = 1 , res = ch-'0';break;} }
    while(true){char ch = getchar();if(ch>='0' && ch<='9') res*=10 , res+=ch-'0';else break;}
    return res*neg;
}


typedef long long Lint;
typedef double db;
typedef pair<int,int> ii;
typedef pair<db,db> dd;
typedef pair<db,int> di;
typedef pair<ii,int> iii;
typedef pair<ii,ii> i4;

const int maxn = 1000020;
const int maxm = 10000020;
const int MOd = 1e9 + 7;
const int K = 300;

int a, x, k;

int mul( int a, int b ) {
    return (Lint)a*b%MOd;
}

int add( int a, int b ) {
    a+=b;
    return a % MOd;
}

int dn[maxn][2];

int main() {

    //freopen("asd.in","r",stdin);
    //freopen("out.txt","w",stdout);

    scanf("%d %d %d",&a,&k,&x);

    if( 1 == x ) dn[1][1] = 1;
    else dn[1][0] = 1;

    for(int i=2;i<a;i++) {
        dn[i][0] = mul( k-2, dn[i-1][0] );
        dn[i][0] = add( dn[i][0], mul( dn[i-1][1], k-1 ) );
        dn[i][1] = dn[i-1][0];
    }

    cout << dn[a-1][0] << endl;

    return 0;
}