#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <cstring>
#include <climits>
#include <cmath>
using namespace std;

#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,x,n) for(ll i=x;i<n;i++)
#define ALL(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<":"<<x<<endl
#define debug2(x,y) cout<<#x<<":"<<#y<<"=="<<x<<":"<<y<<endl
const int INF = INT_MAX / 3;
const int dx[] = { 1, 0, -1, 0 }, dy[] = { 0, 1, 0, -1 };
#define MOD 1000000007
typedef pair<int,int> P;
typedef long long ll;

ll M = 1000000000;

ll m, n;

ll c[10001][10001];

int main(){
	cin >> n >> m;
	ll a = n / m;
	a = a - (a % 1000);
	ll amari = n - m * a;
	ll num = amari / 1000;


	rep(i, 10001){
		c[i][i] = 1;
		c[i][0] = 1;
	}
	for (int i = 1; i <= 10000; i++){
		for (int j = 1; j < i; j++){
			c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
		}
	}

	cout << c[m][num] << endl;
	return 0;
}