#include<cstdio>

#include<cstring>

#include<algorithm>

#include<vector>

using namespace std;

const int N = , mod = ;

int n, m, k, ans;

int dp[N << ][N][][];

void up(int &x, int d) { x = (x + d) % mod; }

int main()

{

    dp[][][][] = ;

    scanf("%d%d%d", &n, &m, &k);

    for(int i = ; i < n + m; ++i)

        for(int j = ; j <= i; ++j)

            for(int x = ; x <= k; ++x)

                for(int y = ; y <= k; ++y)

                {

                    if(x +  <= k) up(dp[i + ][j + ][x + ][max(y - , )], dp[i][j][x][y]);

                    if(y +  <= k) up(dp[i + ][j][max(x - , )][y + ], dp[i][j][x][y]);

                }

    for(int i = ; i <= k; ++i)

        for(int j = ; j <= k; ++j) up(ans, dp[n + m][n][i][j]);

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

    return ;

}