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

const ll MOD = 1e9;

int f(int n, int p){
    if(n < p)
        return 0;
    return (n / p) + f(n / p, p);
}
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;
}

bool isp[10010];

int main(){
    ll N, M;
    cin >> N >> M;
    
    N /= 1000;
    N %= M;
    
    for(int i=2;i<=M;i++)
        isp[i] = true;
    
    for(int p=2;p*p<=M;p++){
        if(!isp[p])
            continue;
        
        for(int kp=p*p;kp<=M;kp+=p)
            isp[kp] = false;
    }
    
    ll res = 1;
    for(int p=2;p<=M;p++){
        if(!isp[p])
            continue;
        
        int e = f(M, p) - f(N, p) - f(M - N, p);
        res = (res * mod_pow(p, e)) % MOD;
    }
    
    cout << res << endl;
    return 0;
}