#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const char IN[] = {"sandokan.in"};
const char OUT[] = {"sandokan.out"};
const int INF = 1000000005;
const double PI  = 3.14159265;
const int NMAX = 5005;
const int MOD = 2000003;

#define II inline
#define LL long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fs first
#define ss second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) 	for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) 	for(int i = a ; i >= b ; i--)
#define FORIT(it, V) 	for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
#define all(a) a, a + 

int N, cN;
int K;
int c[2][NMAX];

void dinamic()
{
	c[0][0] = 1;
	FOR(i, 1, N)
	{
		c[i%2][0] = 1;
		FOR(j, 1, K)
			c[i%2][j] = (c[(i - 1)%2][j] + c[(i - 1)%2][j - 1]) % MOD;
	}		
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);
	scanf("%d%d", &N, &K);
	cN = N - 1;
	while(cN >= K - 1)	cN -= (K - 1);
	N--; K = cN;
	dinamic();
	printf("%d\n", c[N%2][K]);
	return 0;
}