package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func mpow(a, p, m int) int {
	if a == 0 {
		return 0
	}
	if p == 0 {
		return 1
	}
	if p%2 == 0 {
		tmp := mpow(a, p/2, m)
		return tmp * tmp % m
	}
	return a * mpow(a, p-1, m) % m
}

const maxN = 3000

var phi [maxN]int

func initPhi() {
	for i := 0; i < maxN; i++ {
		phi[i] = i
	}
	for i := 2; i < maxN; i++ {
		if i == phi[i] {
			for j := 1; i*j < maxN; j++ {
				phi[i*j] -= phi[i*j] / i
			}
		}
	}
}

func check(a, n int) int {
	if a == 1 {
		return 1
	}
	ret := 1
	for i := 0; i < n; i++ {
		tmp := ret
		ret = 1
		for j := 0; j < tmp; j++ {
			ret *= a
			if ret > maxN {
				return maxN
			}
		}
	}
	return ret
}

func H(a, n, m int) int {
	if m == 1 {
		return 0
	}
	if n == 0 {
		return 1
	}
	tmp := check(a, n)
	if tmp < maxN {
		return tmp % m
	}
	return mpow(a, maxN+(H(a, n-1, phi[m])-maxN)%phi[m], m)
}

func main() {
	sc.Split(bufio.ScanWords)
	A, N, M := getInt(), getInt(), getInt()
	initPhi()
	if M == 1 {
		out(0)
		return
	}
	if N == 0 || A == 1 {
		out(1)
		return
	}
	out(H(A, N, M))
}