#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,a[100005],k;
const int mod= 100003;
int main() {
cin>>n>>k;
a[1]=1;
for(int i=2;i<=100000;i++){
if(k>=i) a[i]=1;
for(int j=max(1,i-k);j<i;j++) a[i]=(a[i]+a[j])%mod;
}
cout<<a[n];
return 0;
}
10-02
1681