# include <algorithm>
using namespace std ;

const char FIN[] = "sandokan.in", FOU[] = "sandokan.out";
const int MAX = 5005, MOD = 2000003;

int C[2][MAX] ;
int N, K, P ;

int main ()
{
    freopen ( FIN, "r", stdin ) ;
    freopen ( FOU, "w", stdout ) ;

    scanf ( "%d %d", &N, &K ) ; --N, --K ;

    P = N % K ? N % K - 1 : K - 1 ;

    C[0][0] = C[1][0] = 1;
    int k = 1;
    for ( int i = 1; i <= N; ++i, k = !k ) {
        for ( int j = 1; j <= min ( i, P ); ++j ) {
            C[k][j] = ( C[!k][j - 1] + C[!k][j] ) % MOD ;
        }
    }

    printf ( "%d", C[k][P] ) ;

    return 0;
}