Finding inverse

import sys
from math import gcd

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

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


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

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: ACCEPTED