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

def compute_tet_mod(a, n, m):
    if m == 1:
        return (0, True)
    if n == 0:
        return (1 % m, 1 >= m)
    if n == 1:
        return (a % m, a >= m)
    phi = totient(m)
    if phi == 0:
        e_val, e_flag = 0, False
    else:
        e_val, e_flag = compute_tet_mod(a, n-1, phi)
    exponent = e_val
    if phi != 0 and e_flag:
        exponent += phi
    if a == 1:
        return (1 % m, 1 >= m)
    if a >= m:
        return (pow(a, exponent, m), True)
    current = 1
    is_ge = False
    for _ in range(exponent):
        current *= a
        if current > m:
            is_ge = True
            break
    mod_result = pow(a, exponent, m)
    return (mod_result, is_ge)

A, N, M = map(int, input().split())

if N == 0:
    print(1 % M)
elif A == 1:
    print(1 % M)
else:
    res, _ = compute_tet_mod(A, N, M)
    print(res)