#include <bits/stdc++.h>

using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long  x,y;
long long MOD;
long long putere(long long a,long long n)
{
    if(n==0)
        return 1;
    if(n%2==1)
        return (a*putere(a,n-1))%MOD;
    long long p = putere(a,n/2);
        return (p*p)%MOD;

}
long long factorial(long long n)
{
    long long f=1;
    for(long long i=1;i<=n;i++)
    {
        f=(f*i)%MOD;
    }

    return f;
}
long long invers_mod(long long n)
{
    return putere(n,MOD-2);
}
long long combinari(long long n,long long k)
{

    return ((long long)factorial(n) * invers_mod(factorial(k))%MOD *invers_mod(factorial(n-k)))%MOD;
}
int main()
{
    f>>x>>MOD;
    g<<invers_mod(x);
    return 0;
}