#include <cstdio>

#define MOD 2000003

using namespace std;

long long n , k , ramas , i , x , R1 , R2;

int main()
{
    freopen("sandokan.in","r",stdin);
    freopen("sandokan.out","w",stdout);
    
    /// combinari de (n - 1) luate cate (n % k - 1)
    
    scanf("%lld %lld", &n, &k);
    
    ramas = n % (k-1); ramas--; n--;
    
    /// combinari de (n) luate cate (ramas)
    /// n! / ramas! * (n - ramas)!
    
    R1 = R2 = 1; if (ramas < 0) ramas = 0;
    
    for (i = ramas + 1; i <= n; ++i)
        R1 = (1LL * R1 * i) % MOD;
    
    for (i = 1; i <= n - ramas; ++i)
        R2 = (1LL * R2 * i) % MOD;
    
    while (R1 % R2 != 0)
        R1 += MOD;
    
    printf("%lld\n", R1 / R2);
    
    return 0;
}