#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9;
const double eps = 1e-8;
const double pi = acos(-1);

ll n, m;

ll solve() {
    n /= 1000;
    n %= m;
    n = min(n, m - n);
    ll dp[2][10001];
    memset(dp, 0, sizeof(dp));
    dp[0][0] = dp[0][1] = 1;
    int p = 0;
    for (int i = 0; i < m-1; i++, p=1-p) {
        p = i % 2;
        dp[1-p][0] = 1;
        for (int j = 1; j <= i+2; j++) dp[1-p][j] = (dp[p][j-1] + dp[p][j]) % mod;
    }
    return dp[p][n];
}

void input() {
    cin >> n >> m;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}