//# include "stdafx.h"

# define _CRT_SECURE_NO_DEPRECATE
# include <fstream>
# include <iostream>
# include <stdlib.h>
# include <queue>
# include <string>
# include <cstdio>
# include <stdio.h>
# include <math.h>
# include <algorithm>
# include <vector>
# include <unordered_map>
# include <set>
# include <map>
# include <iomanip>
# include <math.h>
# include <stack>
# include <functional>
# define inf 9223372036854775807
# define mp make_pair
# define pb push_back
# define FOR(k,a,z) for (int k=a;k<z;k++)
# define pi 3.14159265359
# define maxlong long 2147483647
# define ll long long

#include <cstdio>
#include <cstring>
#define LSOne(S) (S & (-S))
#define MAXLOG 50
#include <sstream>
#include <utility>

#define P 1000000007
#define INF 1000000000

using namespace std;




int main() {
    //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    int n,dif,x;
    cin>>n>>dif>>x;

    if(n==3) {
        if (x==1) {
            cout<<dif-1;
            return 0;
        } else {
            cout<<dif-2;
            return 0;
        }
    }


    if (n==4&&x==1) {
        ll l = ((dif-2)*(dif-1))%P;
        cout<<l;
        return 0;
    }


    ll l = 1;
    ll sheg = dif-1;
    FOR(k,0,n-2) {
        if (k!=n-3) {
            l=(l*sheg)%P;
        } else {
            l=(sheg+(l-1)*(sheg-1))%P;
        }
    }
    cout<<l;



    return 0;
}