#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long c[1010][1010];
long long ans1, ans2;
void init() {
  c[0][0] = 1;
  for (int i = 1; i <= 1000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
    }
  }
}
int main() {
  init();
  int n, m, k;
  cin >> n >> m >> k;
  n -= 2 * k + 1;
  m -= 2 * k + 1;
  for (int i = 0; i <= n; i++) {
    long long tem = c[k + i - 1][k - 1];
    for (int j = 0; j <= n - i; j++) {
      ans1 = (ans1 + tem * c[k + j - 1][k - 1]) % mod;
    }
  }
  for (int i = 0; i <= m; i++) {
    long long tem = c[k + i - 1][k - 1];
    for (int j = 0; j <= m - i; j++) {
      ans2 = (ans2 + tem * c[k + j - 1][k - 1]) % mod;
    }
  }
  cout << (ans1 * ans2) % mod << endl;
}
