#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n, m;std::cin >> n >> m;
  ll x = (n/1000)%m;//何枚余るか
  //mCx
  ll P = 1000000000;
  vll prev(x+1, 0);
  vll now(x+1, 0);
  prev[0] = 1;
  //std::cout << x << '\n';
  for(ll i=0;i<m;i++){
    for(ll j=0;j<=min(i+1, x);j++){
      now[j] = prev[j];
      if(j) now[j] = (now[j] + prev[j-1])%P;
    }
    prev = now;
    re(j, x+1) now[j] = 0;
  }
  std::cout << prev[x] << '\n';
}