#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int dp[1005][1005];
void chk(int &x, int y) { x = (x + y) % mod; }
int main() {
  int n, m, K;
  cin >> n >> m >> K;
  int mx = max(n - 2, m - 2);
  for (int i = 1; i <= mx; i++) dp[1][i] = 1;
  for (int i = 2; i <= K; i++)
    for (int j = 0; j <= mx; j++)
      if (dp[i - 1][j])
        for (int k = j + 2; k <= mx; k++)
          chk(dp[i][k], 1ll * dp[i - 1][j] * (k - j - 1) % mod);
  int ans1 = 0, ans2 = 0;
  for (int i = 1; i < n - 1; i++) chk(ans1, 1ll * dp[K][i] * (n - i - 1) % mod);
  for (int i = 1; i < m - 1; i++) chk(ans2, 1ll * dp[K][i] * (m - i - 1) % mod);
  cout << 1ll * ans1 * ans2 % mod << endl;
  return 0;
}
