#include <iostream>
#include <cmath>
#include <vector>

using ll = long long int;

std::vector<std::vector<int>> memo(10000, std::vector<int>(10000, -1));

ll Combination(ll n, ll r, ll mod){
    if(memo[n-1][r]!=-1) return memo[n-1][r];
    if(r==0 || n==r){
        memo[n-1][r] = 1;
        return 1;
    }
    memo[n-1][r] = (Combination(n-1, r-1, mod) + Combination(n-1, r, mod))%mod;
    return memo[n-1][r];
} 

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    
    ll n, m;
    std::cin >> n >> m;
    std::cout << Combination(m, (n/1000)%m, 1000000000) << "\n";
    return 0;

}