#include <cstdio>
#include <cstring>

#include <algorithm>

using namespace std;

const int MAXN = 50000;
const int MOD = 10000;

int main()
{
    freopen("diamant.in", "r", stdin);
    freopen("diamant.out", "w", stdout);

    int x, n, m;
    scanf("%d %d %d", &x, &n, &m);
    if (abs(x) > MAXN) {
        printf("0\n");
        return 0;
    }
    int rez[MAXN];
    memset(rez, 0, sizeof(rez));
    rez[0] = 1;
    for (int k = 0; k <= x; ++k) 
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= m; ++j) {
                rez[k + i * j] = (rez[k + i * j] + rez[k]) % MOD;
                if (k >= i * j)
                    rez[k - i * j] = (rez[k - i * j] + rez[k]) % MOD;
            }
    printf("%d\n", rez[x]);

    return 0;
}