#include <bits/stdc++.h>
using namespace std;

#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcd(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  i64 n;
  int m;
  cin >> n >> m;
  int k = (n / 1000) % m;

  vvt<int> pascal(m + 1);
  pascal[0] = vt<int>(1, 1);
  pascal[1] = vt<int>(2, 1);
  rep(i, 2, m + 1) {
    pascal[i] = vt<int>(i + 1, -1);
    pascal[i][0] = pascal[i][i] = 1;
    rep(j, 1, i + 1) {
      if(pascal[i][j] != -1) break;
      pascal[i][j] = pascal[i][i - j] = (pascal[i - 1][j - 1] + pascal[i - 1][j]) % mod;
    }
  }
  cout << pascal[m][k] << endl;
}