def main():
    import sys
    A, N, M = map(int, sys.stdin.readline().split())
    
    if M == 1:
        print(0)
        return
    
    if N == 0:
        print(1 % M)
        return
    
    def euler_phi(m):
        if m == 0:
            return 0
        res = m
        i = 2
        while i * i <= m:
            if m % i == 0:
                while m % i == 0:
                    m //= i
                res -= res // i
            i += 1
        if m > 1:
            res -= res // m
        return res
    
    def compute(A, n, m):
        if m == 1:
            return 0
        if n == 0:
            return 1 % m
        if n == 1:
            return A % m
        phi = euler_phi(m)
        e = compute(A, n-1, phi)
        if e == 0 and phi == 0:
            return 0
        if e >= phi:
            e += phi
        return pow(A, e, m)
    
    print(compute(A, N, M))
    
if __name__ == "__main__":
    main()