#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int fact[20000];

int comb(int n, int r) {
    return fact[n] / fact[n - r] / fact[r];
}

int pascal(int n, int r) {
    if (r == 0 || n == r) return 1;
    return pascal(n-1, r) + pascal(n-1, r-1);
}

signed main()
{
    fact[0] = 1;
    FOR(i, 1, 20001) {
        fact[i] = i * fact[i - 1];
    }
    int n, m;
    cin >> n >> m;
    int each = n / 1000 / m * 1000;
    int mod = (n - each * m) / 1000; // 分けたい1000円札の数
    cout << pascal(m, mod) % 1000000000 << endl;

    return 0;
}