#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, maxn = 1000005;
int fact[maxn], inv[maxn];
void init(int n = 1e6) {
  fact[0] = 1;
  for (int i = 1; i <= n; i++)
    fact[i] = (long long)i * fact[i - 1] % 1000000007;
  inv[1] = 1;
  for (int i = 2; i <= n; i++)
    inv[i] = 1000000007 -
             (long long)(1000000007 / i) * inv[1000000007 % i] % 1000000007;
  inv[0] = 1;
  for (int i = 1; i <= n; i++)
    inv[i] = (long long)inv[i - 1] * inv[i] % 1000000007;
}
int C(int n, int m) {
  if (m > n) return 0;
  return (long long)fact[n] * inv[m] % 1000000007 * inv[n - m] % 1000000007;
}
int Pow(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (long long)ans * a % 1000000007;
    a = (long long)a * a % 1000000007;
    b >>= 1;
  }
  return ans;
}
int f[1005];
int main() {
  init();
  int n, m, k;
  while (~scanf("%d%d%d", &n, &m, &k)) {
    if (m == 1) {
      printf("%d\n", Pow(k, n));
      continue;
    }
    f[1] = 1;
    for (int i = 2; i <= n; i++) {
      f[i] = Pow(i, n);
      for (int j = 1; j < i; j++) {
        f[i] -= (long long)C(i, j) * f[j] % 1000000007;
        if (f[i] < 0) f[i] += 1000000007;
      }
    }
    int ans = 0;
    for (int i = 0; i <= n; i++) {
      int res = 0;
      for (int j = i; j <= n; j++) {
        int temp = (long long)f[j] * f[j] % 1000000007;
        temp = (long long)temp * C(k - i, 2 * (j - i)) % 1000000007 *
               C(2 * (j - i), j - i) % 1000000007;
        res += temp;
        if (res >= 1000000007) res -= 1000000007;
      }
      res = (long long)res * C(k, i) % 1000000007 * Pow(i, n * (m - 2)) %
            1000000007;
      ans += res;
      if (ans >= 1000000007) ans -= 1000000007;
    }
    printf("%d\n", ans);
  }
  return 0;
}
