#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int M = 1000005;
int n, k, m;
long long ans, sum;
long long dp[1003], fac[M], inv[M];
long long quickpow(long long x, int y) {
  long long s = 1;
  for (; y; y >>= 1, x = x * x % mod)
    if (y & 1) s = s * x % mod;
  return s;
}
long long C(int x, int y) {
  if (x < y) return 0;
  return fac[x] * inv[y] % mod * inv[x - y] % mod;
}
int main() {
  fac[1] = inv[1] = inv[0] = fac[0] = 1;
  for (int i = 2; i <= 1000000; i++) {
    fac[i] = 1ll * i * fac[i - 1] % mod;
    inv[i] = quickpow(fac[i], mod - 2);
  }
  scanf("%d%d%d", &n, &m, &k);
  if (m == 1) {
    printf("%I64d\n", quickpow(1ll * k, n));
    return 0;
  }
  dp[1] = 1;
  for (int i = 2; i <= n; i++) {
    dp[i] = quickpow(1ll * i, n);
    for (int j = 1; j < i; j++) {
      dp[i] -= C(i, j) * dp[j] % mod;
    }
    dp[i] = (dp[i] % mod + 1ll * mod) % mod;
  }
  if (m == 2) {
    for (int i = 1; i <= n && i <= k; i++)
      ans += dp[i] * dp[i] % mod * C(k, i) % mod * C(k, i) % mod, ans %= mod;
    printf("%I64d\n", ans);
    return 0;
  }
  for (int i = 0; i <= n && i <= k; i++)
    for (int j = 0; j <= n && j <= k; j++) {
      if (i + j + j > k || i + j > n) break;
      if (i + j == 0) continue;
      ans += dp[i + j] * dp[i + j] % mod * C(k, i) % mod * C(k - i, j) % mod *
             C(k - i - j, j) % mod * quickpow(i, n * (m - 2)) % mod;
      ans %= mod;
    }
  printf("%I64d\n", ans);
  return 0;
}
