#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define reset(a,b) memset(a,b,sizeof a);
#define ALL(x) x.begin(),x.end()
#define debug(x) cout<<#x<<" = "<<(x)<<endl
#define sz(x) (int)(x.size())
#define lt(x) (int)(x.length())
#define MOD 1000000007 
#define mx 1000003

long long fak[mx], inv[mx];

long long POW(long long a, int b){
	long long ret = 1;
	while(b > 0){
		if(b & 1)
			ret = ret * a % MOD;
		b >>= 1;
		a = a * a % MOD;
	}
	return ret;
}



typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e6 + 3;
const int MAXN = 400005;

namespace fft{
	typedef complex<double> base;
	void fft(vector<base> &a, bool inv){
		int n = a.size(), j = 0;
		vector<base> roots(n/2);
		for(int i=1; i<n; i++){
			int bit = (n >> 1);
			while(j >= bit){
				j -= bit;
				bit >>= 1;
			}
			j += bit;
			if(i < j) swap(a[i], a[j]);
		}
		double ang = 2 * acos(-1) / n * (inv ? -1 : 1);
		for(int i=0; i<n/2; i++){
			roots[i] = base(cos(ang * i), sin(ang * i));
		}
		for(int i=2; i<=n; i<<=1){
			int step = n / i;
			for(int j=0; j<n; j+=i){
				for(int k=0; k<i/2; k++){
					base u = a[j+k], v = a[j+k+i/2] * roots[step * k];
					a[j+k] = u+v;
					a[j+k+i/2] = u-v;
				}
			}
		}
		if(inv) for(int i=0; i<n; i++) a[i] /= n;
	}

	vector<lint> multiply(vector<lint> &v, vector<lint> &w){
		vector<base> fv(v.begin(), v.end()), fw(w.begin(), w.end());
		int n = 1;
		while(n < max(v.size(), w.size())) n <<= 1;
		n <<= 1;
		fv.resize(n);
		fw.resize(n);
		fft(fv, 0);
		fft(fw, 0);
		for(int i=0; i<n; i++) fv[i] *= fw[i];
		fft(fv, 1);
		vector<lint> ret(n);
		for(int i=0; i<n; i++) ret[i] = (lint)round(fv[i].real());
		return ret;
	}
	vector<lint> multiply(vector<lint> &v, vector<lint> &w, lint mod){
		int n = 1;
		while(n < max(v.size(), w.size())) n <<= 1;
		n <<= 1;
		vector<base> v1(n), v2(n);
		vector<base> r1(n), r2(n);
		for(int i=0; i<v.size(); i++){
			v1[i] = base(v[i] >> 15, v[i] & 32767);
		}
		for(int i=0; i<w.size(); i++){
			v2[i] = base(w[i] >> 15, w[i] & 32767);
		}
		fft(v1, 0);
		fft(v2, 0);
		for(int i=0; i<n; i++){
			int j = (i ? (n - i) : i);
			base ans1 = (v1[i] + conj(v1[j])) * base(0.5, 0);
			base ans2 = (v1[i] - conj(v1[j])) * base(0, -0.5);
			base ans3 = (v2[i] + conj(v2[j])) * base(0.5, 0);
			base ans4 = (v2[i] - conj(v2[j])) * base(0, -0.5);
			r1[i] = (ans1 * ans3) + (ans1 * ans4) * base(0, 1);
			r2[i] = (ans2 * ans3) + (ans2 * ans4) * base(0, 1);
		}
		fft(r1, 1);
		fft(r2, 1);
		vector<lint> ret(n);
		for(int i=0; i<n; i++){
			lint av = (lint)round(r1[i].real());
			lint bv = (lint)round(r1[i].imag()) + (lint)round(r2[i].real());
			lint cv = (lint)round(r2[i].imag());
			av %= mod, bv %= mod, cv %= mod;
			ret[i] = (av << 30) + (bv << 15) + cv;
			ret[i] %= mod;
			ret[i] += mod;
			ret[i] %= mod;
		}
		return ret;
	}
}



int main(){
	// precalc();
	fak[0] = 1;
	for(int i = 1; i <= 1e6; i++)
		fak[i] = fak[i - 1] * i % MOD;
	inv[(int)1e6] = POW(fak[(int)1e6], MOD - 2);
	for(int i = 1e6 - 1; i >= 0; i--)
		inv[i] = inv[i + 1] * (i + 1) % MOD;
	long long n, m, k, jaw = 0;
	cin >> n >> m >> k;
	// for(int i = 0; i <= m; i++){
	// 	for(int j = 0; j <= k; j++){
	// 		int tot = n + i + j - 1;
	// 		long long kem = fak[tot] * inv[n - 1] % MOD * inv[i] % MOD * inv[j] % MOD;
	// 		long long sisa = m - i + k - j;
	// 		kem = kem * POW(3, sisa) % MOD;
	// 		jaw = (jaw + kem) % MOD;
	// 	}
	// }

	vector<long long> a(m + 1, 0), b(k + 1, 0), res;
	for(int i = 0; i <= m; i++)
		a[i] = inv[i];
	for(int i = 0; i <= k; i++)
		b[i] = inv[i];

	res = fft::multiply(a, b, MOD);

	// for(int i = 0; i <= m + k; i++)
		// cout << i << " -> " << res[i] << endl;
	// debug(inv[m] * inv[k] % MOD);
	for(int i = 0; i <= m + k; i++){
		int tot = n + i - 1;
		long long kem = fak[tot] * inv[n - 1] % MOD * res[i] % MOD;
		long long sisa = m - i + k;
		kem = kem * POW(3, sisa) % MOD;
		jaw = (jaw + kem) % MOD;
	}
	cout << jaw << endl;
}

Measured memory_bytes: 94336