#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

const int mod = 1000000000;

int gcd(int, int);

int main() {
	long long n;
	int m;

	cin >> n >> m;

	n /= 1000;
	int atari = n - (n / m) * m;

	// cout << atari << endl;
	int small = min(atari, m - atari);

	vector<int> left, right;
	for (int i = 0; i < small; i++) {
		left.push_back(m - i);
		right.push_back(i + 1);
	}

	for (int i = 0; i < small; i++) {
		for (int j = 0; j < small; j++) {
			int g = gcd(left[i], right[j]);
			// printf("%d %d %d\n", left[i], right[j], g);
			left[i] /= g;
			right[j] /= g;
			if (left[i] == 1) {
				break;
			}
		}
	}

	long long ans = 1;
	for (int i = 0; i < small; i++) {
		ans = (ans * left[i]) % mod;
	}

	cout << ans << endl;
	return 0;
}

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a % b);
}