#include <bits/stdc++.h>
#define REP(i,n,N) for(ll i=(n);i<(ll) N;i++)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll mod=1e9;

int main(){
	ll n,m;
	cin>>n>>m;
	ll dist=n/1000/m;
	ll r=n-dist*1000*m;
	r/=1000;
	ll ans=1;
	REP(i,1,r+1){
		ans*=(m-i+1);
		ans/=i;
	}
	p(ans%mod);
	return 0;
}