#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 207 ;
const int MOD = 1e9 + 7 ;

ll fastpow ( ll x , ll pw ) {
    ll ret = 1 ;
    while ( pw > 0 ) {
        if ( ( pw % 2 ) == 0 ) {
            x = ( x * x ) % MOD ;
            pw /= 2 ;
        }
        else {
            ret = ( ret * x ) % MOD ;
            -- pw ;
        }
    }
    return ret ;
}

int n , m , k ;
ll fac[ MAXN ] , inv[ MAXN ] ;

ll comb ( int up , int down ) {
    if ( up < down || down < 0 ) { return 0 ; }
    ll ret = fac[ up ] ;
    ret = ( ret * inv[ down ] ) % MOD ;
    ret = ( ret * inv[ up - down ] ) % MOD ;
    return ret ;
}

ll a[ MAXN ][ MAXN ] ;

void solve ( ) {
    cin >> n >> m >> k ;
    fac[ 0 ] = 1 ;
    for ( int i = 1 ; i < MAXN ; ++ i ) {
        fac[ i ] = ( fac[ i - 1 ] * i ) % MOD ;
    }
    inv[ MAXN - 1 ] = fastpow ( fac[ MAXN - 1 ] , MOD - 2 ) ;
    for ( int i = MAXN - 2 ; i >= 0 ; -- i ) {
        inv[ i ] = ( inv[ i + 1 ] * ( i + 1 ) ) % MOD ;
    }
    for ( int i = 1 ; i <= m ; ++ i ) {
        for ( int j = 1 ; j <= m ; ++ j ) {
            a[ i ][ j ] = comb ( k + n , k - i + j ) ;
        }
    }
    ll ans = 1 ;
    for ( int i = 1 ; i <= m ; ++ i ) {
        if ( a[ i ][ i ] == 0 ) {
            for ( int j = i + 1 ; j <= m ; ++ j ) {
                if ( a[ j ][ i ] != 0 ) {
                    for ( int t = 1 ; t <= m ; ++ t ) {
                        swap ( a[ i ][ t ] , a[ j ][ t ] ) ;
                    }
                    break ;
                }
            }
        }
        ans = ( ans * a[ i ][ i ] ) % MOD ;
        if ( a[ i ][ i ] == 0 ) { continue ; }
        ll coef = fastpow ( a[ i ][ i ] , MOD - 2 ) ;
        for ( int j = i + 1 ; j <= m ; ++ j ) {
            ll aux = ( coef * a[ j ][ i ] ) % MOD ;
            for ( int t = i ; t <= m ; ++ t ) {
                a[ j ][ t ] = ( a[ j ][ t ] + MOD - ( aux * a[ i ][ t ] ) % MOD ) % MOD ;
            }
        }
    }
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}