#[allow(unused_macros)]
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)*}
    };
}

#[allow(unused_macros)]
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)*}
    };
}

#[allow(unused_macros)]
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, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

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

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

pub mod modular {
    const M: i64 = 1000000007;

    #[derive(Debug, Clone, Copy, Default, PartialOrd, Ord, PartialEq, Eq)]
    pub struct Mod(i64);

    impl ::std::fmt::Display for Mod {
        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
            write!(f, "{}", self.0)
        }
    }

    impl Mod {
        pub fn new(v: i64) -> Mod {
            Mod(v % M)
        }

        pub fn pow(self, mut r: i64) -> Mod {
            let mut k = self;
            let mut ret = 1.into();

            while r > 0 {
                if r % 2 != 0 {
                    ret = ret * k;
                }
                r /= 2;
                k = k * k;
            }

            ret
        }

        // This requires M is prime
        pub fn recip(self) -> Mod {
            self.pow(M - 2)
        }
    }

    use std::ops::*;

    impl<T: Into<Mod>> Add<T> for Mod {
        type Output = Mod;
        fn add(self, rhs: T) -> Self::Output {
            Mod::new(self.0 + rhs.into().0)
        }
    }
    impl<T: Into<Mod>> AddAssign<T> for Mod {
        fn add_assign(&mut self, rhs: T) {
            *self = *self + rhs;
        }
    }

    impl<T: Into<Mod>> Sub<T> for Mod {
        type Output = Mod;
        fn sub(self, rhs: T) -> Self::Output {
            Mod::new(self.0 - rhs.into().0 + M)
        }
    }
    impl<T: Into<Mod>> SubAssign<T> for Mod {
        fn sub_assign(&mut self, rhs: T) {
            *self = *self - rhs;
        }
    }

    impl<T: Into<Mod>> Mul<T> for Mod {
        type Output = Mod;
        fn mul(self, rhs: T) -> Self::Output {
            Mod::new(self.0 * rhs.into().0)
        }
    }
    impl<T: Into<Mod>> MulAssign<T> for Mod {
        fn mul_assign(&mut self, rhs: T) {
            *self = *self * rhs;
        }
    }

    impl<T: Into<Mod>> Div<T> for Mod {
        type Output = Mod;
        fn div(self, rhs: T) -> Self::Output {
            self * rhs.into().recip()
        }
    }
    impl<T: Into<Mod>> DivAssign<T> for Mod {
        fn div_assign(&mut self, rhs: T) {
            *self = *self / rhs;
        }
    }

    impl Neg for Mod {
        type Output = Mod;
        fn neg(self) -> Self::Output {
            Mod(0) - self
        }
    }

    impl<T: ::std::convert::Into<i64>> ::std::convert::From<T> for Mod {
        fn from(v: T) -> Self {
            Mod::new(v.into())
        }
    }
}

use modular::Mod;

use std::collections::BTreeMap;

use std::cmp::{max, min};

fn main() {
    input! {
        n: i64,
        m: i64,
        k: i64,
    }

    // let mut mm_naive = BTreeMap::new();

    // for i1 in 0..n {
    //     for j1 in 0..m {
    //         for i2 in 0..n {
    //             for j2 in 0..m {
    //                 let d = (i1 - i2).abs() + (j1 - j2).abs();
    //                 *mm_naive.entry(d).or_insert(0) += 1;
    //             }
    //         }
    //     }
    // }

    // dbg!(&mm_naive);

    let mut mm = BTreeMap::new();

    for l in 1..n + m - 2 + 1 {
        if l < m {
            let cur = n * (m - l) * 2;
            *mm.entry(l).or_insert(0) += cur;
        }
        if l < n {
            let cur = (n - l) * m * 2;
            *mm.entry(l).or_insert(0) += cur;
        }

        // (l-1 >= i && l-m < i)
        // l-m<i<=l-1

        for i in max(1, l - m + 1)..min(n, l - 1 + 1) {
            // j = [l-n-1 .. l-1]
            // 1 <= [l-n-1 .. l-1] < m

            let j = l - i;
            // if !(j >= 1 && j < m) {
            //     continue;
            // }

            // dbg!((i, j));

            let cur = (n - i) * (m - j) * 4;
            *mm.entry(l).or_insert(0) += cur;
        }
    }

    // dbg!(&mm);

    // assert_eq!(mm, mm_naive);

    let mut ans = Mod::new(0);
    for (k, v) in mm.iter() {
        ans += Mod::new(k * v);
    }
    ans *= comb(n * m, k);
    ans *= k;
    ans /= n * m;
    ans *= k - 1;
    ans /= n * m - 1;
    ans /= 2;

    println!("{}", ans);
}

fn comb(n: i64, k: i64) -> Mod {
    fact(n) / fact(k) / fact(n - k)
}

fn fact(n: i64) -> Mod {
    if n == 0 {
        1.into()
    } else {
        fact(n - 1) * Mod::new(n)
    }
}


Measured memory_bytes: 13564