#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>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

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 T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }


const long long MOD = 1000000007;
long long N, M, K;

inline long long mod(long long a, long long m) {
    return (a % m + m) % m;
}

inline long long inv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a/b;
        a -= t*b; swap(a, b);
        u -= t*v; swap(u, v);
    }
    return mod(u, m);
}

const int MAX_R = 310000;
long long DCom[MAX_R];

void calc_Dcom_pre(long long n, long long p) {
    long long t = 1; DCom[0] = t;
    for (int i = 1; i < MAX_R; ++i) {
        t = mod(t * (n-i+1), p);
        t = mod(t * inv(i, p), p);
        DCom[i] = t;
    }
}

long long NCom[11000], MCom[11000];

void calc_com() {
	NCom[0] = MCom[0] = 1;
	for (int i = 0; i <= K; ++i) {
		NCom[i+1] = NCom[i];
		NCom[i+1] = mod(NCom[i+1] * (N+i*2+2), MOD);
		NCom[i+1] = mod(NCom[i+1] * (N+i*2+1), MOD);
		NCom[i+1] = mod(NCom[i+1] * inv(i+1, MOD), MOD);
		NCom[i+1] = mod(NCom[i+1] * inv(N+i+1, MOD), MOD);

		MCom[i+1] = MCom[i];
		MCom[i+1] = mod(MCom[i+1] * (M+i*2+2), MOD);
		MCom[i+1] = mod(MCom[i+1] * (M+i*2+1), MOD);
		MCom[i+1] = mod(MCom[i+1] * inv(i+1, MOD), MOD);
		MCom[i+1] = mod(MCom[i+1] * inv(M+i+1, MOD), MOD);
	}
}


int main() {
    //freopen( "/Users/macuser/Dropbox/Contest/input.in", "r", stdin );
    
	while (cin >> N >> M >> K) {
		calc_Dcom_pre(N + M + K*2, MOD);
		calc_com();
		long long res = 0;
		for (int i = 0; i <= K; ++i) {
			int j = K-i;
			long long tmp = DCom[N+i*2];
			tmp = mod(tmp * NCom[i], MOD);
			tmp = mod(tmp * (N+1), MOD);
			tmp = mod(tmp * inv(N+i+1, MOD), MOD);
			tmp = mod(tmp * MCom[j], MOD);
			tmp = mod(tmp * (M+1), MOD);
			tmp = mod(tmp * inv(M+j+1, MOD), MOD);
			res = mod(res + tmp, MOD);

			//cout << i << " : " << res << ", " << tmp << endl;
		}
		cout << res << endl;
	}
    return 0;
}


Measured memory_bytes: 3744