#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> Tp;

const ll MOD = 1e9;

ll mod_pow(ll x, ll e){
    ll v = 1;
    for(;e;e>>=1){
        if(e & 1)
            v = (v * x) % MOD;
        x = (x * x) % MOD;
    }
    return v;
}

ll inverse(ll a, ll m){
    ll b = m, u = 1, v = 0;
    while (b) {
        ll t = a / b;
        swap(a -= t * b, b);
        swap(u -= t * v, v);
    }
    return (u % m + m) % m;
}

Tp calc(int N){
    ll rem = 1;
    int two = 0, five = 0;
    
    for(int i=1;i<=N;i++){
        int j = i;
        while(j % 2 == 0){
            ++two;
            j /= 2;
        }
        while(j % 5 == 0){
            ++five;
            j /= 5;
        }
        rem = (rem * j) % MOD;
    }
    
    return Tp(rem, two, five);
}

int main(){
    ll N, M;
    cin >> N >> M;
    
    N /= 1000;
    N %= M;
    
    auto a = calc(M);
    auto b = calc(N);
    auto c = calc(M - N);
    
    int two = get<1>(a) - get<1>(b) - get<1>(c);
    int five = get<2>(a) - get<2>(b) - get<2>(c);
    
    ll res = get<0>(a) * inverse(get<0>(b) * get<0>(c) % MOD, MOD) % MOD;
    res = (res * mod_pow(2, two)) % MOD;
    res = (res * mod_pow(5, five)) % MOD;
    
    cout << res << endl;
    return 0;
}