#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;

const int N = 1e5 + 10;
int dp[N][2];

int main() {
  int n, k, x;
  scanf("%d%d%d", &n, &k, &x);
  dp[0][0] = 1; dp[0][1] = 0;
  for (int i = 1; i < n; ++i) {
    dp[i][0] = (int64)dp[i - 1][1] * (k - 1) % MOD;
    dp[i][1] = (dp[i - 1][0] + (int64)(k - 2) * dp[i - 1][1]) % MOD;
  }
  int ret = x == 1 ? dp[n - 1][0] : dp[n - 1][1];
  printf("%d\n", ret);
  return 0;
}