#include using namespace std; const long long mod=1e9+7; long long countArray(int n, int k, int x) { // Return the number of ways to fill in the array. long long base=k,ans=1; n-=3; while(n--) { ans*=base; ans%=mod; } return ans%mod; } int main() { int n; int k; int x; cin >> n >> k >> x; long long answer = countArray(n, k, x); cout << answer << endl; return 0; }