#include <iostream>
#include <deque>
#include <vector>
#include <cstring>
#include <bitset>
#include <algorithm>
#define INF 1000010
#define uint unsigned int
#define ll long long
#define split 10000
using namespace std;

ll N, M, X, Y;

ll gcd(ll A, ll B, ll &X, ll &Y)
{
    if(!B)
    {
        X = 1; Y = 0;
        return A;
    }
    ll X0, Y0;
    ll result = gcd(B, A % B, X0, Y0);
    X = Y0;
    Y = X0 - (A/B) * Y0;
    return result;
}


int main()
{
    freopen("inversmodular.in","r",stdin);
    freopen("inversmodular.out","w",stdout);
    scanf("%lld%lld", &N, &M);
    ll d = gcd(N, M, X, Y);
    while(X < 0)
        X = X + M;
    printf("%lld\n",X);
    return 0;
}