import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


long lcm(long a, long b) {
  return a / gcd(a, b) * b;
}

immutable L = 10;

long mod(long a, long m) {
  return (a < L) ? a : (L + (a - L) % m);
}

long power(long a, long e, long m) {
  long x = a, y = 1;
  for (; e; e >>= 1) {
    if (e & 1) {
      y = mod(y * x, m);
    }
    x = mod(x * x, m);
  }
  return y;
}

long arrow2(long a, long n, long m) {
  if (n == 0) {
    return 1;
  }
  if (n == 1) {
    return mod(a, m);
  }
  if (n == 2) {
    return power(a, a, m);
  }
  if (a == 1) {
    return 1;
  }
  if (m == 1) {
    // a >= 2, n >= 3
    return L;
  }
  long period = 1;
  long mm = m;
  for (long d = 2; d * d <= mm; ++d) {
    if (mm % d == 0) {
      long pk = 1;
      do {
        pk *= d;
        mm /= d;
      } while (mm % d == 0);
      period = lcm(period, (d == 2 && pk >= 8) ? (pk / 4) : (pk / d * (d - 1)));
    }
  }
  if (mm > 1) {
    period = lcm(period, mm - 1);
  }
  return power(a, arrow2(a, n - 1, period), m);
}

long A, N, M;

void main() {
  try {
    for (; ; ) {
      A = readLong();
      N = readLong();
      M = readLong();
      auto ans = arrow2(A, N, M);
      ans %= M;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}