#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7, MAXN = 3000;
int c[MAXN][MAXN];
int n, m, k;
int main() {
  ios_base::sync_with_stdio(0);
  for (int i = 0; i < MAXN; ++i) {
    c[0][i] = 1;
    c[i][i] = 1;
  }
  for (int i = 1; i < MAXN; ++i)
    for (int j = i + 1; j < MAXN; ++j)
      c[i][j] = (c[i][j - 1] + c[i - 1][j - 1]) % INF;
  cin >> n >> m >> k;
  k += k;
  cout << ((long long)c[k][n - 1] * c[k][m - 1]) % INF << "\n";
  return 0;
}
