#include <iostream>
#include <algorithm>
#include <vector>
#include <cassert>

using namespace std;

static const long long MOD = 1000000000LL;
static int gcdValues[10001][10001] = { 0 };

int gcd(int x, int y) {
	if (gcdValues[x][y] != 0) {
		return gcdValues[x][y];
	}
	int result = y == 0 ? x : gcd(y, x % y);
	gcdValues[x][y] = result;
	gcdValues[y][x] = result;
	return result;
}

int main() {
	long long n, m;
	cin >> n >> m;
	long long win = n / 1000 % m;
	long long lose = m - win;
	vector<long long> numerators;
	for (long long i = max(win, lose) + 1; i <= m; ++i) {
		numerators.push_back(i);
	}
	for (long long i = min(win, lose); i >= 2; --i) {
		long long denominator = i;
		for (size_t k = 0; k < numerators.size() && denominator > 1; ++k) {
			long long divisor = gcd((int)numerators[k], (int)denominator);
			if (divisor > 1) {
				numerators[k] /= divisor;
				denominator /= divisor;
			}
		}
		assert(denominator == 1);
	}
	long long result = 1;
	for (size_t i = 0; i < numerators.size(); ++i) {
		result *= numerators[i];
		result %= MOD;
	}
	cout << result << endl;
	return 0;
}