def my_pow(a, n, m, r=1):
    # [a, n, m, r] = [底, 指数, 返値の最大値, 初項]
    r = ((r * a) % m) if n & 0b1 else r
    if n > 2:
        return my_pow((a * a) % m, n // 2, m, r)

    else:
        return r


def my_mul(a, b, m):
    # a*b
    return (a * b) % m


def my_div(a, b, m):
    # a/b
    return (a * my_pow(b, m - 2, m)) % m


output_max = 1000000000 + 7
s = input()
s = s.split()
inp = [int(tmp) for tmp in s]

a = inp[0]
b = inp[1]
c = inp[2]

# 階乗のチートシート作成
my_fact = [-1, 1, 1]
tmp = 1
for i in range(2, 300000):
    tmp *= i
    tmp %= output_max
    my_fact.append(tmp)

# 2のべき乗のチートシート作成
my_2xp = [1]
tmp = 1
for i in range(1, 299999):
    tmp *= 2
    tmp %= output_max
    my_2xp.append(tmp)

res = 0
k = a + b + c - 1
for i in range(0, a):
    k -= 1
    tmp = my_2xp[k] - 1
    tmp = (tmp * my_fact[k]) % output_max
    res += my_div(tmp, my_fact[a - i], output_max)
    res %= output_max

res = my_div(res, (my_fact[b] * my_fact[c]) % output_max, output_max)
print(res)