#include <bits/stdc++.h>
#pragma GCC optimize "03"
using namespace std;
const long long int N = 1e3 + 5;
const long long int mod = 1e9 + 7;
const long long int inf = 1e9 + 9;
long long int dp[N], pre[N], cur[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, m, k;
  cin >> n >> m >> k;
  for (long long int i = 1; i < N; i++) dp[i] = 1;
  for (long long int j = 1; j <= k; j++) {
    for (long long int i = 1; i < N; i++) pre[i] = (pre[i - 1] + dp[i]) % mod;
    for (long long int i = 3; i < N; i++)
      cur[i] = (pre[i - 3] + dp[i - 2] + cur[i - 1]) % mod;
    for (long long int i = 1; i < N; i++) dp[i] = cur[i];
  }
  cout << (dp[n] * dp[m]) % mod;
  return 0;
}
