class Combination:
    '''MOD上の
    計算量：階乗・逆元テーブルの作成O(N)
    nCkを求めるO(1)'''

    def __init__(self, n, MOD):
        self.fact = [1]
        for i in range(1, n + 1):
            self.fact.append(self.fact[-1] * i % MOD)
        self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]
        self.MOD = MOD

    def factorial(self, k):
        """k!を求める O(1)"""
        return self.fact[k]

    def inverse_factorial(self, k):
        """k!の逆元を求める O(1)"""
        return self.inv_fact[k]

    def permutation(self, k, r):
        """kPrを求める O(1)"""
        if k < r:
            return 0
        return (self.fact[k] * self.inv_fact[r]) % self.MOD

    def combination(self, k, r):
        """kCrを求める O(1)"""
        if k < r:
            return 0
        return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD


a, b, c = map(int, input().split())
n = a + b + c
MOD = 10**9 + 7
comb = Combination(3 * 10**5 + 10, MOD)

ans = 0
for i in range(1, a+1):
    unused_a = a - i
    unused_b = b - 1
    unused_c = c
    unused = unused_a + unused_b + unused_c
    pattern = comb.combination(unused, unused_a) * comb.combination(unused - unused_a, unused_c)
    pattern %= MOD
    pattern = (pow(2, unused, MOD)-1) * pattern * unused_c * pow(unused, MOD - 2, MOD)
    ans += pattern % MOD
    ans %= MOD
print(ans % MOD)