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