#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;

#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }




const int MAX = 21000000;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAX; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
long long COM(int n, int k){
    if(n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    long long b = mod, u = 1, v = 0;
    while (b) {
        long long t = a/b;
        a -= t*b; swap(a, b);
        u -= t*v; swap(u, v);
    }
    u %= mod;
    if (u < 0) u += mod;
    return u;
}



long long H, W, K;
long long dp[110][110];

/*
long long solve() {
    memset(dp, 0, sizeof(dp));
    for (long long h = 0; h <= H; ++h) {
        for (long long  w = 0; w <= W; ++w) {
            if (h - 1 >= 0) dp[h][w] += dp[h-1][w] * h % MOD;
            if (w - 1 >= 0) dp[h][w] += dp[h][w-1] * w % MOD;
            long long fact = (h+1) * (w+1) % MOD * fac[h+w] % MOD;
            dp[h][w] = (dp[h][w] + fact) % MOD;
            if (h == 0 && w == 0) dp[0][0] = 0;
            
            cout << h << ", " << w << ": " << dp[h][w] << endl;
        }
    }
    long long res = 0;
    for (int k = 0; k <= K; ++k) {
        long long fact = COM(H, k) * COM(W, K-k) % MOD;
        res += fact * dp[k][K-k] % MOD;
        res %= MOD;
    }
    return res;
}
 */

long long solve() {
    long long res = 0;
    /*
    for (long long i = 0; i <= K; ++i) {
        for (long long j = 0; i+j <= K; ++j) {
            if (i + j == 0) continue;
            long long tmp = COM(H, i) * COM(W, j) % MOD * fac[i+j] % MOD * (i+1) % MOD * (j+1) % MOD * fac[H+W-i-j] % MOD * finv[H+W-K] % MOD;
            res += tmp;
            
            cout << i << ", " << j << ": " << tmp << endl;
            res %= MOD;
        }
    }
     */
    
    for (long long n = 1; n <= K; ++n) {
        long long tmp1 = (n + 1) * COM(H + W, H) % MOD;
        long long tmp2 = n * (n - 1) % MOD * COM(H + W - 2, H - 1) % MOD;
        long long tmp = (tmp1 + tmp2) % MOD * fac[H] %  MOD * fac[W] % MOD * finv[H+W-K] % MOD;
        res += tmp;
        res %= MOD;
        //cout << n << ": " << tmp1 << ", " << tmp2 <<", " << tmp << endl;
    }
    
    return res;
}



int main() {
    COMinit();
    while (cin >> H >> W >> K) {
        cout << solve() << endl;
    }
}












Measured memory_bytes: 492416