#include <bits/stdc++.h>
using namespace std;
long long int fact[1000005], ifact[1000005], dp[10005][1005];
long long int bpow(long long int x, long long int n) {
  long long int ans = 1;
  while (n > 0) {
    if (n & 1) ans *= x;
    x *= x;
    ans %= 1000000007;
    x %= 1000000007;
    n /= 2;
  }
  return ans;
}
void pre_calc(long long int N) {
  fact[0] = ifact[0] = 1;
  for (long long int i = 1; i <= N; ++i) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
    ifact[i] = bpow(fact[i], 1000000007 - 2);
  }
}
long long int ncr(int n, int r) {
  if (r < 0 or n < r) return 0;
  long long int ans = fact[n];
  ans = (ans * ifact[r]) % 1000000007;
  ans = (ans * ifact[n - r]) % 1000000007;
  return ans;
}
long long int add(long long int x, long long int y) {
  x = (x + y) % 1000000007;
  return x;
}
long long int mul(long long int x, long long int y) {
  return (1LL * x * y) % 1000000007;
}
int main() {
  ios::sync_with_stdio(false);
  ;
  cin.tie(0);
  ;
  long long int i, j, x, y, n, m, k, ans = 0, got = 0;
  pre_calc(1000000);
  dp[1][1] = 1;
  for (i = 2; i <= 1000; i++) {
    for (j = 1; j <= i; j++) {
      dp[i][j] = add(dp[i][j], mul(j, dp[i - 1][j]));
      dp[i][j] = add(dp[i][j], dp[i - 1][j - 1]);
    }
  }
  cin >> n >> m >> k;
  if (m == 1) {
    cout << bpow(k, n);
    return 0;
  }
  for (x = 1; x <= n; x++) {
    for (y = x; y >= 0 && 2 * x - y <= k; y--) {
      got = ncr(k, 2 * x - y);
      got = mul(got, ncr(2 * x - y, x - y));
      got = mul(got, ncr(x, x - y));
      got = mul(got, dp[n][x]);
      got = mul(got, dp[n][x]);
      got = mul(got, fact[x]);
      got = mul(got, fact[x]);
      got = mul(got, bpow(y, 1LL * n * (m - 2)));
      ans = add(ans, got);
    }
  }
  cout << ans;
  return 0;
}
