#include <iostream>
#include <string>
#include <vector>
#include <map>
using namespace std;

typedef long long ll;
const int mod = 1000000000;

map<pair<ll,ll>, ll> mm;

ll cmb(ll n, ll k) {
    if (k == 0 || n == k) return 1LL;
    pair<ll, ll> key = make_pair(n, k);
    if (mm.count(key)) return mm[key];
    return mm[key] = (cmb(n-1, k-1) + cmb(n-1, k)) % mod;
}

int main() {
    ll N, M;
    cin >> N >> M;
    ll t = (N - ((N / 1000) / M * 1000) * M) / 1000;
    cout << cmb(M, max(0LL, min(M, t))) % mod << endl;
    return 0;
}