#include <iostream>
#include <fstream>
#define M 2000003
#define LEN 2<<15
 
using namespace std;
 
ifstream f("sandokan.in");
ofstream g("sandokan.out");
 
int DP[LEN];
 
int solutie(int N, int K){
    DP[0] = 1;
    
    if(K > N)
        return 0;
        
    for(unsigned int i = 1; i <= N; ++i)
        for(unsigned int j = i; j > 0; --j)
            DP[j] = (DP[j] + DP[j-1]) % M;
 
    return DP[K];
}
int main(){
 
    int N, K;
 
    f >> N >> K;
 
    N--; K--;
 
    g << solutie(N ,N % K) << endl;
 
 
}