Finding inverse

import sys
from math import gcd

x, m = map(int, sys.stdin.readline().split())

def totient(n):
    phi = n
    p = 2
    while(p*p <= n):
        if(n%p == 0):
            phi -= phi // p
            while(n%p == 0):
                n //= p
        p += 1
    if n > 1:
        phi -= phi // n
    return phi

res = -1

if gcd(x, m) == 1:
    res = pow(x, totient(m)-1, m)
    
print(res)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED