#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e6 + 1;
const int mod = (int)1e9 + 7;
const int M = (int)1e6 + 100;
int c[2111][2111], n, m, k;
int main() {
  cin >> n >> m >> k;
  c[0][0] = 1;
  for (int i = 1; i < 2111; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
    }
  }
  cout << c[n - 1][2 * k] * 1ll * c[m - 1][2 * k] % mod;
}
