#include <fstream>

using namespace std;

ifstream in("nmult.in");
ofstream out("nmult.out");

const int MOD = 666013;

long long putere(long long x, int p) {
    long long a = 1;
    x %= MOD;
    while(p > 0) {
        while(p % 2 == 0) {
            x = x * x % MOD;
            p /= 2;
        }
        a = a * x % MOD;
        p--;
    }
    return a;
}

void genComb(int n, int k) {
    if(k > n-k) k = n-k;
    long long c = 1, f = 1;
    for(int i = 1; i <= k; i++) {
        c = c*(n-i+1)%MOD;
        f = f*i%MOD;
    };
    c = c * putere(f, MOD-2) % MOD;
    out << c;
}


int main()
{
    int k, n, w;
    in >> n >> k >> w;
    int r = n - (k + (k-1)*(w-1));
    if(r < 0) out << 0 << '\n';
    else if(r == 0) out << 1 << '\n';
    else genComb(r+k, r);
    return 0;
}