#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
struct st {
  int h, w, k;
  bool operator<(const st &a) const {
    if (h != a.h) return h < a.h;
    if (w != a.w) return w < a.w;
    return k < a.k;
  }
};
map<st, long long> M;
long long s(int h, int w, int k) {
  if (k == 0) {
    return 1;
  }
  if (h > w) swap(h, w);
  map<st, long long>::iterator itr = M.find((st){h, w, k});
  if (itr != M.end()) return (*itr).second;
  long long cnt = 0;
  for (int i = 2 * (k - 1) + 1; i < h - 1; i++) {
    for (int j = 2 * (k - 1) + 1; j < w - 1; j++) {
      long long tmp = s(i, j, k - 1);
      long long a = h - 1 - i, b = w - 1 - j;
      long long tmp2 = a * b % mod;
      cnt = cnt + (tmp * tmp2) % mod;
      cnt %= mod;
    }
  }
  return M[(st){h, w, k}] = cnt;
}
long long dp[1001][1001];
long long solve(int h, int k) {
  if (k == 0) return 1;
  long long &ret = dp[h][k];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = 2 * (k - 1) + 1; i < h - 1; i++) {
    long long tmp = solve(i, k - 1);
    long long a = h - 1 - i;
    ret = ret + (tmp * a) % mod;
    ret %= mod;
  }
  return ret;
}
int main() {
  long long h, w, k;
  double maxi = 0;
  while (cin >> h >> w >> k && h) {
    for (int i = 0; i < 1001; i++)
      for (int j = 0; j < 1001; j++) dp[i][j] = -1;
    long long a1 = solve(w, k) % mod, a2 = solve(h, k) % mod;
    cout << a1 * a2 % mod << endl;
  }
}
