/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (Windows, macOS, Linux)
 * Author: alireza_kaviani
 * Time: 2020-06-08 15:10:32
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define all(x)                      (x).begin(),(x).end()
#define Sort(x)                     sort(all((x)))
#define X                           first
#define Y                           second
#define sep                         ' '
#define endl                        '\n'
#define SZ(x)                       ll(x.size())

ll poww(ll a, ll b, ll md) {
    return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}

const ll MAXN = 1e4 + 10;
const ll LOG = 22;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; // 998244353; // 1e9 + 9;

ll n , m , k , ans , pw3[MAXN] , fact[MAXN] , inv[MAXN];

int main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    fact[0] = 1; inv[0] = 1;
    pw3[0] = 1;
    for(int i = 1 ; i < MAXN ; i++) pw3[i] = pw3[i - 1] * 3 % MOD;
    for(int i = 1 ; i < MAXN ; i++) fact[i] = fact[i - 1] * i % MOD , inv[i] = poww(fact[i] , MOD - 2 , MOD);
    cin >> n >> m >> k;
    for(int i = 0 ; i <= m ; i++){
        for(int j = 0 ; j <= k ; j++){
            if(i == 0 && j != k)    continue;
            if(j == 0 && i != m)    continue;
            ll cur = fact[n + m + k - i - j] * inv[n] % MOD * inv[m - i] % MOD * inv[k - j] % MOD * pw3[i + j];
            ans += cur % MOD;
        }
    }
    cout << ans % MOD << endl;

    return 0;
}
/*

*/
