#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
long long dp[1005][1005], fact[1000005], revfact[1000005];
long long binpow(long long first, int step) {
  if (step == 0) return 1;
  if (step % 2 == 0) {
    long long t = binpow(first, step / 2);
    return t * t % MOD;
  } else
    return first * binpow(first, step - 1) % MOD;
}
long long C(int n, int k) {
  return fact[n] * revfact[k] % MOD * revfact[n - k] % MOD;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  if (m == 1) {
    long long ans = 1;
    for (int i = 1; i <= n; i++) ans = (ans * (long long)k) % MOD;
    cout << ans;
  } else {
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= i; j++)
        dp[i][j] = (long long)j * (dp[i - 1][j - 1] + dp[i - 1][j]) % MOD;
    fact[0] = 1;
    for (int i = 1; i <= k; i++) fact[i] = fact[i - 1] * (long long)i % MOD;
    revfact[k] = binpow(fact[k], MOD - 2);
    for (int i = k - 1; i >= 0; i--)
      revfact[i] = revfact[i + 1] * (long long)(i + 1) % MOD;
    long long ans = 0;
    for (int a = 1; a <= n; a++)
      for (int c = 0; c <= a; c++) {
        if (2 * a - c > k) continue;
        long long tek = C(k, c) * C(k - c, a - c) % MOD * C(k - a, a - c) % MOD;
        tek = tek * dp[n][a] % MOD * dp[n][a] % MOD * binpow(c, n * m - 2 * n) %
              MOD;
        ans = (ans + tek) % MOD;
      }
    cout << ans;
  }
  return 0;
}
