#include <bits/stdc++.h>
using namespace std;
bool o1;
long long n, m, k, g[1010], h[1010], f1[1010], f2[1010], ans, P = 1e9 + 7;
bool o2;
int main() {
  cin >> n >> m >> k, n -= 2, m -= 2;
  for (long long j = 1; j <= n; j++) f1[j] = 1;
  for (long long i = 2; i <= k; i++)
    for (long long j = 1; j <= n; j++)
      g[j] = (f1[j] + g[j - 1]) % P, h[j] = (g[j] + h[j - 1]) % P,
      f1[j] = j < 2 ? 0 : h[j - 2];
  for (long long j = 1; j <= m; j++) f2[j] = 1;
  for (long long i = 2; i <= k; i++)
    for (long long j = 1; j <= m; j++)
      g[j] = (f2[j] + g[j - 1]) % P, h[j] = (g[j] + h[j - 1]) % P,
      f2[j] = j < 2 ? 0 : h[j - 2];
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= m; j++)
      (ans += (n - i + 1) * f1[i] % P * (m - j + 1) % P * f2[j] % P) %= P;
  cout << ans;
  return 0;
}
