#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
long long quick_pow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long fac[N + 10], inv[N + 10], dp[N + 10];
void init() {
  fac[0] = inv[0] = 1;
  for (int i = 1; i <= N; i++) fac[i] = fac[i - 1] * i % mod;
  inv[N] = quick_pow(fac[N], mod - 2);
  for (int i = N - 1; i >= 1; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
}
long long C(long long n, long long m) {
  if (m > n) return 0;
  return fac[n] * inv[n - m] % mod * inv[m] % mod;
}
int main() {
  init();
  long long n, m, k;
  cin >> n >> m >> k;
  long long maxn = min(n, k);
  for (int i = 1; i <= maxn; i++) {
    dp[i] = quick_pow(i, n);
    for (int j = 1; j <= i - 1; j++)
      dp[i] = (dp[i] - C(i, j) * dp[j] % mod + mod) % mod;
  }
  if (m == 1)
    cout << quick_pow(k, n) << endl;
  else if (m == 2) {
    long long ans = 0;
    for (int i = 1; i <= maxn; i++)
      ans = (ans + (C(k, i) * dp[i] % mod * C(k, i) % mod * dp[i] % mod)) % mod;
    cout << ans << endl;
  } else {
    long long ans = 0;
    for (int i = 1; i <= maxn; i++)
      for (int j = 0; j <= maxn; j++)
        if (i + j <= n && i + j + j <= k)
          ans = (ans + (dp[i + j] * dp[i + j] % mod * C(k, i) % mod *
                        C(k - i, j) % mod * C(k - i - j, j) % mod *
                        quick_pow(i, n * (m - 2)) % mod)) %
                mod;
    cout << ans << endl;
  }
  return 0;
}
