//Problema Sandokan - Rezolvare C++: 100p -> infoarena.ro
//Stud. Cristian CRIȘAN - AC, CTI-RO, ANUL I

#include <iostream>
#include <fstream>

#define SIZE 5005
#define Modulo(x) (x % 2000003)

using namespace std;

ifstream fin("sandokan.in");
ofstream fout("sandokan.out");

void solve(int n, int k)
{
    int i, j, v[SIZE];
    v[0] = 1;
    k = (-- n) % (k - 1);
    if(k > n)
        fout << "1\n";
    for(i = 1; i <= n; ++ i)
        for(j = i; j > 0; -- j)
            v[j] = Modulo(v[j] + v[j - 1]);
    fout << v[k] << '\n';
}

int main()
{
    int n, k;
    fin >> n >> k;
    solve(n, k);
    return 0;
}