#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:134217728")
using namespace std;
const int MOD = (int)1e9 + 7;
int n, m, k;
long long f[1 << 20];
long long inv[1 << 20];
long long powmod(long long a, int x) {
  if (x == 0) return 1;
  if (x & 1) return a * powmod(a * a % MOD, x / 2) % MOD;
  return powmod(a * a % MOD, x / 2);
}
long long dp[1 << 10];
long long pw[1 << 10];
long long C[1 << 10][1 << 10];
long long cnt(int k) {
  long long& res = dp[k];
  if (res != -1) return res;
  res = 0;
  int sign = 1;
  for (int i = k; i > 0; --i) {
    res = (res + sign * C[k][i] * powmod(i, n)) % MOD;
    if (res < 0) res += MOD;
    sign = -sign;
  }
  return res;
}
int main() {
  f[0] = 1;
  for (int i = 1; i < 1 << 20; ++i) f[i] = f[i - 1] * i % MOD;
  for (int i = 0; i < 1 << 20; ++i) inv[i] = powmod(f[i], MOD - 2);
  cin >> n >> m >> k;
  if (m == 1) {
    cout << powmod(k, n) << endl;
    return 0;
  }
  for (int i = 0; i < 1 << 10; ++i) {
    C[i][i] = 1;
    C[i][0] = 1;
  }
  for (int i = 2; i < 1 << 10; ++i) {
    for (int j = 1; j < i; ++j) {
      C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
      if (C[i][j] >= MOD) C[i][j] -= MOD;
    }
  }
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i <= n; ++i) pw[i] = powmod(i, n * (m - 2));
  long long res = 0;
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= n - i; ++j) {
      if (i + 2 * j > k) continue;
      long long add = f[k] * inv[i] % MOD;
      add = add * inv[j] % MOD;
      add = add * inv[j] % MOD;
      add = add * inv[k - i - 2 * j] % MOD;
      add = add * cnt(i + j) % MOD;
      add = add * cnt(i + j) % MOD;
      add = add * pw[i] % MOD;
      res += add;
      if (res >= MOD) res -= MOD;
    }
  }
  cout << res << endl;
  return 0;
}
