/**************************************************************

     Problem: 1037

     User: Tunix

     Language: C++

     Result: Accepted

     Time:460 ms

     Memory:42660 kb

 ****************************************************************/

 //BZOJ 1037

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*sign;

 }

 const int N=,INF=~0u>>,MOD=;

 typedef long long LL;

 /******************tamplate*********************/

 int n,m,k,f[N][N][][],ans;

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1037.in","r",stdin);

     freopen("1037.out","w",stdout);

 #endif

     n=getint(); m=getint(); k=getint();

     f[][][][]=;

     F(i,,n) F(j,,m) F(k1,,k) F(k2,,k){

         if (k1+<=k) (f[i+][j][k1+][max(k2-,)]+=f[i][j][k1][k2])%=MOD;

         if (k2+<=k) (f[i][j+][max(k1-,)][k2+]+=f[i][j][k1][k2])%=MOD;

     }

     F(x,,k) F(y,,k) (ans+=f[n][m][x][y])%=MOD;

     printf("%d\n",ans);

     return ;

 }