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

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

const ll MOD = 1e9;
const int sz = 2;
const int mod_ps[sz] = {2, 5};
const int mod_pk[sz] = {512, 1953125};

ll fact[sz][2000000];
void init(){
    for(int i=0;i<sz;i++){
        int p  = mod_ps[i];
        int pk = mod_pk[i];
        
        fact[i][0] = 1;
        for(int j=1;j<pk;j++){
            if(j % p == 0){
                fact[i][j] = fact[i][j-1];
            } else {
                fact[i][j] = fact[i][j-1] * j % pk;
            }
        }
    }
}

ll mod_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;
}

ll gcd(ll a, ll b){
    if(b == 0)return a;
    return gcd(b, a % b);
}

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

ll mod_fact(int n, int i, int p, int pk, int &e1, int &e2){
    e1 = e2 = 0;
    if(n == 0)return 1;
    
    ll res = mod_fact(n / p, i, p, pk, e1, e2);
    
    e1 += n / p;
    e2 += n / pk;
    res = res * fact[i][n % pk] % pk;
    
    return res;
}

pair<ll, ll> linear_congruence(const vector<ll>& A, const vector<ll> &B, const vector<ll>& M){
    ll x = 0, m = 1;
    
    for(int i=0;i<A.size();i++){
        ll a = A[i] * m, b = B[i] - A[i] * x, d = gcd(M[i], a);
        if(b % d != 0)return make_pair(0, -1);
        ll t = b / d * mod_inverse(a / d, M[i] / d) % (M[i] / d);
        x = x + m * t;
        m *= M[i] / d;
    }
    
    x = (x % m + m) % m;
    return make_pair(x, m);
}

ll C(int n, int r, int i){
    const int p  = mod_ps[i];
    const int pk = mod_pk[i];
    
    int e1, e2, e3;
    int k1, k2, k3;
    
    ll a1 = mod_fact(n,   i, p, pk, e1, k1);
    ll a2 = mod_fact(r,   i, p, pk, e2, k2);
    ll a3 = mod_fact(n-r, i, p, pk, e3, k3);
    
    int e = e1 - e2 - e3;
    int k = k1 - k2 - k3;
    
    ll res = 1;
    res = (res * mod_pow(p, e, pk)) % pk;
    res = (res * mod_pow(fact[i][pk-1], k, pk)) % pk;
    res = (res * a1) % pk;
    res = (res * mod_inverse(a2 * a3 % pk, pk)) % pk;
    
    return res;
}

ll C(int n, int r){
    vector<ll> A(sz, 1);
    vector<ll> B(sz), M(sz);
    
    for(int i=0;i<sz;i++){
        B[i] = C(n, r, i);
        M[i] = mod_pk[i];
    }
    
    pair<ll, ll> ps = linear_congruence(A, B, M);
    return ps.first;
}

int main(){
    init();
    
    ll N, M;
    cin >> N >> M;
    
    N /= 1000;
    N %= M;
    
    cout << C(M, N) << endl;
    return 0;
}