#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int dp[2][10001];

int main() {
	ll mod = 1000000000;
	ll n, m;
	cin >> n >> m;
	
	n /= 1000;
	n %= m;
	
	dp[0][0] = 1;
	REP(i, m) {
		int now = i % 2;
		int next = !now;
		
		fill(dp[next], dp[next + 1], 0);
		
		REP(j, i + 1) {
			(dp[next][j] += dp[now][j]) %= mod;
			(dp[next][j + 1] += dp[now][j]) %= mod;
		}
	}
	
	cout << dp[m % 2][n] << endl;
	
	return 0;
}