#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int fac[1000010], rfac[1000010], ri[1000010];
void init() {
  fac[0] = 1;
  for (int i = 1; i < 1000010; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  rfac[0] = rfac[1] = 1, ri[1] = 1;
  for (int i = 2; i < 1000010; i++) {
    int t = mod / i;
    ri[i] = (1ll * t * (mod - ri[mod % i])) % mod;
    rfac[i] = (1ll * rfac[i - 1] * ri[i]) % mod;
  }
}
int C(int n, int k) {
  if (0 <= k && k <= n) return 1ll * fac[n] * rfac[k] % mod * rfac[n - k] % mod;
  return 0;
}
int expmod(int a, int b) {
  int rlt = 1;
  for (a %= mod; b; a = 1ll * a * a % mod, b >>= 1)
    if (b & 1) rlt = 1ll * rlt * a % mod;
  return rlt;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  init();
  int n, m, k;
  cin >> n >> m >> k;
  if (m == 1) {
    cout << expmod(k, n);
    return 0;
  }
  vector<int> f(n + 1);
  f[1] = 1;
  for (int i = 2; i <= n; i++) {
    f[i] = expmod(i, n);
    for (int j = i - 1; j >= 1; j--) f[i] = (f[i] - 1ll * C(i, j) * f[j]) % mod;
    if (f[i] < 0) f[i] += mod;
  }
  int ans = 0;
  for (int y = 0; y <= n; y++) {
    int now = 0;
    for (int t = 0; t + y <= n; t++) {
      now = (now + 1ll * C(k - y, 2 * t) * C(2 * t, t) % mod * f[y + t] % mod *
                       f[y + t]) %
            mod;
    }
    ans = (ans + 1ll * now * expmod(y, n * (m - 2)) % mod * C(k, y)) % mod;
  }
  cout << ans;
  return 0;
}
