[快速幂]a^b

#include <cstdio>
#define ll long long

using namespace std ;

ll ( ll a , ll b , ll p ){
    ll ans = 1 % p , base = a ;
    while ( b ){
        if ( b & 1 ){
            ans = (ans % p * base % p) % p ;
        }
        base = base * base % p ;
        b >>= 1 ;
    }
    return ans ;
}

int main(){
    ll a , b , p ;
    while ( scanf("%lld %lld %lld" , &a , &b , &p) != EOF ){
        printf("%lldn" , quick_pow(a , b , p)) ;
    }
    return 0 ;
}