#include <bits/stdc++.h>
const int mod = 1e9+7;
long long fp(long long b, int e){
    if(e) return fp(b*b%mod, e>>1) * (e&1?b:1) % mod;
    return 1;
}
long long C(long long n, int k){
    if(n == k) return 1;
    if(k < 0 || k > n) return 0;
    long long ans{1};
    for(int i=0; i<k; ++i){
        ans = ans * ((n-i)%mod) % mod;
        ans = ans * fp(i+1, mod-2) % mod;
    }
    return ans;
}
signed main() {
    long long n, m;
    int k;
    std::cin >> n >> m >> k;
    std::cout << C(n-1, k-1) * C(m+1, k) % mod << '\n';
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CmNvbnN0IGludCBtb2QgPSAxZTkrNzsKbG9uZyBsb25nIGZwKGxvbmcgbG9uZyBiLCBpbnQgZSl7CiAgICBpZihlKSByZXR1cm4gZnAoYipiJW1vZCwgZT4+MSkgKiAoZSYxP2I6MSkgJSBtb2Q7CiAgICByZXR1cm4gMTsKfQpsb25nIGxvbmcgQyhsb25nIGxvbmcgbiwgaW50IGspewogICAgaWYobiA9PSBrKSByZXR1cm4gMTsKICAgIGlmKGsgPCAwIHx8IGsgPiBuKSByZXR1cm4gMDsKICAgIGxvbmcgbG9uZyBhbnN7MX07CiAgICBmb3IoaW50IGk9MDsgaTxrOyArK2kpewogICAgICAgIGFucyA9IGFucyAqICgobi1pKSVtb2QpICUgbW9kOwogICAgICAgIGFucyA9IGFucyAqIGZwKGkrMSwgbW9kLTIpICUgbW9kOwogICAgfQogICAgcmV0dXJuIGFuczsKfQpzaWduZWQgbWFpbigpIHsKICAgIGxvbmcgbG9uZyBuLCBtOwogICAgaW50IGs7CiAgICBzdGQ6OmNpbiA+PiBuID4+IG0gPj4gazsKICAgIHN0ZDo6Y291dCA8PCBDKG4tMSwgay0xKSAqIEMobSsxLCBrKSAlIG1vZCA8PCAnXG4nOwp9

NCAyIDMK

4 2 3