//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

template <uint MD> struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(uint(ull(v) * r.v % MD)); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<TEN(9) + 7>;

const int MN = 3 * 1100100;
V<Mint> fact(MN + 1), iFac(MN + 1), p2(MN + 1);
void first() {
    fact[0] = Mint(1);
    for (int i = 1; i <= MN; i++) {
        fact[i] = fact[i - 1] * Mint(i);
    }
    iFac[MN] = fact[MN].inv();
    for (int i = MN; i >= 1; i--) {
        iFac[i - 1] = iFac[i] * Mint(i);
    }
    p2[0] = Mint(1);
    for (int i = 1; i <= MN; i++) {
        p2[i] = p2[i - 1] * Mint(2);
    }
}

Mint C(int n, int k) {
    if (n < k || k < 0) return Mint(0);
    return fact[n] * iFac[k] * iFac[n - k];
}

int main() {
    first();

    int x, y, z;
    cin >> x >> y >> z;

    if (x == 0 && y == 0 && z == 0) {
        cout << 1 << endl;
        return 0;
    }


    int n = x + y + z + 10;
    Mint ans = 0;    

    // naive sol
/*    for (int k = 0; k <= n; k++) {
        for (int l = 0; l <= k; l++) {
            ans += p2[k] * C(k, l) * (((l + x + y + z) % 2) ? Mint(-1) : Mint(1)) * C(l, x) * C(l, y) * C(l, z);
        }
    }
    ans /= Mint(2);*/

    // fix l
    // -> sum_l (sum_k 2^k C(k, l)) f(l)
    // sum_k 2^k C(k, l)
    // = [x^l] sum_{i = 0..n-1} (2 + 2x)^i
    // = [x^l] ({1 - (2 + 2x)^n} / {1 - (2 + 2x)})
    
    // 1 - (2 + 2x)^n = 1 - 2^n (1 + x)^n
    V<Mint> po(n + 1);
    po[0] += Mint(1);
    for (int i = 0; i <= n; i++) {
        po[i] -= p2[n] * C(n, i);
    }

    //    po / {1 - (2 + 2x)}
    // =  po / {- 1 - 2x}
    // = -po / {1 + 2x}
    for (int i = 0; i <= n; i++) po[i] *= Mint(-1);

    Mint rem = po[n], i2 = Mint(2).inv();
    po[n] = Mint(0);
    for (int i = n - 1; i >= 0; i--) {
        Mint nx = po[i];
        po[i] = rem * i2;
        rem = nx - po[i];
    }

    for (int l = 0; l < n; l++) {
        ans += po[l] * (((l + x + y + z) % 2) ? Mint(-1) : Mint(1)) * C(l, x) * C(l, y) * C(l, z);
    }
    ans /= Mint(2);

    cout << ans.v << endl;
    return 0;
}