//qscqesze
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define maxn 200001
#define mod 10007
#define eps 1e-9
int Num;
char CH[20];
//const int inf=0x7fffffff;   //нчоч╢С
const int inf=0x3f3f3f3f;
/*

inline void P(int x)
{
    Num=0;if(!x){putchar(‘0‘);puts("");return;}
    while(x>0)CH[++Num]=x%10,x/=10;
    while(Num)putchar(CH[Num--]+48);
    puts("");
}
*/
inline ll read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
    return x*f;
}
inline void P(int x)
{
    Num=0;if(!x){putchar(‘0‘);puts("");return;}
    while(x>0)CH[++Num]=x%10,x/=10;
    while(Num)putchar(CH[Num--]+48);
    puts("");
}
//**************************************************************************************

#define MM 1000000007
#define Cm 2001
#define Cn 2001
int wc[Cn+4][Cm+4];  
void init(){
    for(int i=0;i<=Cm;i++)
        wc[i][0]=1;
    for(int i=1;i<=Cn;i++){
        for(int j=1;j<=Cm&&j<=i;j++){
            wc[i][j]=(wc[i-1][j-1]+wc[i-1][j])%MM;
        }
    }

}
int main(){
    int m,n,k;
    init();
    while(scanf("%d%d%d",&m,&n,&k)!=-1){
        printf("%lld\n",(long long)wc[m-1][2*k]*wc[n-1][2*k]%MM);
    }
    return 0;
}