#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<pair<int, int>, int> p;

#define MOD 1000000007

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

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

    ll mod = pow(10, 9) + 7;

    ll N, M;
    cin >> N >> M;

    map<ll, ll> a;

    for(ll i = 2LL; i * i <= M; i++) {
        while(M % i == 0) {
            a[i]++;
            M /= i;
        }
    }

    if(M != 1) a[M]++;

    ll ans = 1LL;

    for(auto i = begin(a); i != a.end(); i++) {
        ll c = 1LL;
        for(ll j = 0LL; j < i -> second; j++) {
            c *= (N + j) % mod;
            c %= mod;
            c *= modpow(j + 1LL, mod - 2LL, mod) % mod;
            c %= mod;
        }
        ans *= c;
        ans %= mod;
    }

    cout << ans % mod << endl;
}
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000

using namespace std;
ll power(ll n, ll k){
  ll res = 1;
  while(k > 0){
    if (k & 1) 
      res = res * n % MOD;
    n = n * n % MOD;
    k >>= 1;
  }
  return res;
}

ll genfact(ll n, ll k){

  ll res = 1;
  k--;
  while (k >= 0){
    res = (res * (n - k)) % MOD;
    k--;
  }

  return res;
}

ll inv(ll n){
  return power(n, MOD - 2);
}

ll fact(ll n){
  return genfact(n, n - 1);
}

ll nck(ll n, ll k){
  if (k == 0)
    return 1;
  if (n <= 0)
    return 0;

  return ((genfact(n, k) % MOD) * inv(fact(k))) % MOD;
}

int main(void){
  ll n, m, k;
  cin >> n >> m >> k;
  
  ll ans = 0;

  ll t = nck(n*m-2,k-2);
  for (ll j = 1; j < m; j++){
    ans += j*(m-j) % MOD * n % MOD *n % MOD * t % MOD;
    ans = (ans % MOD);
  }
  for (ll i = 1; i < n; i++){
    ans += i*(n-i) % MOD * m % MOD *m % MOD * t % MOD;
    ans = (ans % MOD);
  }
  cout << ans << endl;

  return 0;
}
