def METHOD_NAME(number, modulo):
    # Declaring variables as global so that we can use anywhere else in the program.
    global t1
    global t2
    # BASE CASE of the Recursion
    if number == 0:
        t1 =0
        t2 =1
        return modulo
    # Finding the remainder of the number with modulo
    remainder = modulo%number
    # Recursively calling the function to find gcd so we can say that the mmi exist or not.
    gcd = METHOD_NAME(remainder,number)
    # Finding the quotient of the number with modulo
    quotient = modulo // number
    # The Extended Euclidean Algorithm
    # To find the value of mmi
    t = t1
    t1 = t2 - quotient*t1
    t2 = t
    # Returning the gcd to check whether the inverse exist or not
    return gcd