macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{min, max};

fn main() {
    input!{
        n: usize,
        m: usize,
        k: usize
    }
    let d = 1000000007;
    let mut st = vec![0; n + m + k];
    st[0] = 1;
    for i in 1..n + m + k {
        st[i] = st[i - 1] * i % d;
    }
    let sti: Vec<usize> = st.iter().cloned().map(|x| inv_m(x, d)).collect();
    let mut pow3 = vec![0; m + k + 1];
    pow3[0] = 1;
    for i in 0..m + k {
        pow3[i + 1] = pow3[i] * 3 % d;
    }
    let m1 = min(m, k);
    let k1 = max(m, k);
    let mut ans = pow3[m + k];
    let mut s = 1;
    for i in 1..m + k + 1 {
        if i <= m1 {
            s = s * 2 % d;
        } else if i <= k1 {
            s = (s * 2 + d - st[i - 1] * sti[i - 1 - m] % d * sti[m] % d) % d;
        } else {
            s = (s * 2 + 2 * d - st[i - 1] * sti[i - 1 - m] % d * sti[m] % d - st[i - 1] * sti[i - 1 - k] % d * sti[k] % d) % d;
        }
        ans = (ans + st[i + n - 1] * sti[n - 1] % d * sti[i] % d * pow3[m + k - i] % d * s) % d;
    }
    println!("{}", ans);
}

fn pow_m(n: usize, mut p: usize, d: usize) -> usize {
    let mut r = n;
    let mut ret = 1;
    while p > 0 {
        if p % 2 == 0 {
            r = r * r % d;
            p /= 2;
        } else {
            ret = ret * r % d;
            p -= 1;
        }
    }
    ret
}

fn inv_m(n: usize, d: usize) -> usize {
    pow_m(n, d - 2, d)
}
