#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <unordered_map>

#define NMAX 5003
#define MOD 2000003

using namespace std;

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

int n, k;
int prec[NMAX],curr[NMAX];

int main()
{
	fin >> n >> k;
	int m = n;
	while (m >= k)
	{
		m = m - k + 1;
	}

	//calculez comb de n luate cate m
	prec[1] = 1;
	prec[0] = 1;
	for (int i = 2; i <= n-1; i++)
	{
		curr[0] = 1;
		for (int j = 1; j <= i; j++)
		{
			curr[j] = prec[j] + prec[j - 1];
			curr[j] %= MOD;
		}
		curr[i] = 1;
		for (int j = 0; j <= i; j++)
		{
			prec[j] = curr[j];
		}
	}
	fout << curr[m-1];
	return 0;
}