//lucas

#include <iostream>

using namespace std;

typedef long long ll;

//a^b%m 快速幂

int quick_power_mod(int a, int b, int m)

{

      int result = ;

      int base = a;

      while(b > )

      {

            if(b& == )//如果b是奇数

            {

                  result = (result * base) % m;

            }

            base = (base * base)%m;

            b>>=;

      }

      return result;

}

 //组合数取模 C(a,b)%p

 ll composition(ll a, ll b, int p)

 {

       if(a < b)

            return ;

       if(a == b)

            return ;

       if(b > a - b) b = a - b;

       int ans = , ca  = , cb = ;

       for(ll i =  ;i < b; i++)

       {

             ca = (ca * (a - i))%p;

             cb = (cb * (b - i))%p;

       }

       ans = (ca * quick_power_mod(cb,p - , p)) % p;

       return ans;

 }

 ll lucas(ll n , ll m , ll p)

 {

       ll ans = ;

       while(n && m && ans)

       {

             ans = (ans * composition(n%p, m%p, p))%p;

             n /= p;

             m /= p;

       }

       return ans;

 }

int main()

{

      ll m, n;

      while(cin >> m >> n)

      {

            cout << lucas(m,n,) << endl; //这里的104729是比较大的一个素数

      }

    return ;

}