#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <set>
#include <map>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int const MOD = 1e9;

ll dp[10001][10001];

int main() {

  ll N, M;
  cin >> N >> M;
  N /= 1000;
  ll R = N % M;

  rep(i, 10001) {
    dp[i][i] = dp[i][0] = 1;
    REP(j, 1, i) {
      dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]) % MOD;
    }
  }

  cout << dp[M][R] << endl;

  return 0;
}