def primeFactor(N):
    i, n, ret, d, sq = 2, N, {}, 2, 99
    while i <= sq:
        k = 0
        while n % i == 0: n, k, ret[i] = n//i, k+1, k+1
        if k > 0 or i == 97: sq = int(n**(1/2)+0.5)
        if i < 4: i = i * 2 - 1
        else: i, d = i+d, d^6
    if n > 1: ret[n] = 1
    return ret

# Euler's Totient Function
def ETF(N):
    pf = primeFactor(N)
    a = 1
    for p in pf:
        a *= (p-1) * (p ** (pf[p] - 1))
    return a

def ccalc(a, n, m):
    if n == 0: return 1
    if n == 1: return a % m
    if m == 1: return 0
    return pow(a, calc(a, n - 1, ETF(m)), m)
def calc(a, n, m, s = 1):
    if n == 0: return 1
    if n == 1: return a % m
    if m == 1: return 0
    return pow(a, calc(a, n - 1, ETF(m)), m)

def naive(A, N, M):
    a, n, m = A, N, M
    if a == 1: return 1
    s = 1
    for i in range(n):
        if s >= 50: return calc(a, n-i, m, s)
        s = pow(a, s)
    return s % M

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