#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

ll mod=1e9;
ll comb[20001][20001];

int main(void){
  ll n, m; cin >> n >> m;
  ll rem=n-n/m/1000*m*1000; rem=rem/1000;
  for(int i=0; i<=rem+m; i++){
    for(int j=0; j<=i; j++){
      if(j==0||j==i) comb[i][j]=1;
      else comb[i][j]=comb[i-1][j-1]+comb[i-1][j], comb[i][j]%=mod;
    }
  }
  cout << comb[m][rem] << endl;
  return 0; 
}