#include <bits/stdc++.h>
using namespace std;
long long F[1000050], dp[2050][2050];
long long mul(long long a, long long b) { return (a * b) % (1000000000 + 7); }
long long pm(long long a, long long b) {
  if (!b)
    return 1;
  else {
    long long ret = pm(a, b / 2);
    ret = mul(ret, ret);
    return (b % 2) ? mul(ret, a) : ret;
  }
}
long long inv(long long x) { return pm(x, (1000000000 + 7) - 2); }
long long C(long long n, long long k) {
  return mul(mul(F[n], inv(F[k])), inv(F[n - k]));
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  if (m == 1) {
    cout << pm(k, n) << endl;
    return 0;
  }
  F[0] = 1;
  for (int i = 1; i <= 1000050; i++) F[i] = (F[i - 1] * i) % (1000000000 + 7);
  dp[0][0] = 1LL;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      dp[i][j] = (dp[i - 1][j] * j + dp[i - 1][j - 1]) % (1000000000 + 7);
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i; j++) {
      if (k < 2 * i - j) continue;
      long long cnt = 1;
      cnt = mul(cnt, C(k, 2 * i - j));
      cnt = mul(cnt, C(2 * i - j, (i - j)));
      cnt = mul(cnt, C(i, (i - j)));
      cnt = mul(cnt, dp[n][i]);
      cnt = mul(cnt, dp[n][i]);
      cnt = mul(cnt, F[i]);
      cnt = mul(cnt, F[i]);
      cnt = mul(cnt, pm(j, (m - 2) * n));
      ans = (ans + cnt) % (1000000000 + 7);
    }
  }
  cout << ans << endl;
}
