扩展欧拉降幂

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <stdio.h>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string.h>
#include <vector>
#define ME(x , y) memset(x , y , sizeof(x))
#define SF(n) scanf("%d" , &n)
#define rep(i , n) for(int i = 0 ; i < n ; i ++)
#define INF  0x3f3f3f3f
#define mod 20191117
#define PI acos(-1)
using namespace std;
typedef long long ll ;



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

ll get_phi(ll x)
{
    ll ans = x ;
    for(int i = 2 ; i * i <= x ; i++)
    {
        if(x % i == 0)
        {
            ans = ans - ans / i ;
            while(x % i == 0)
                x = x / i ;
        }
    }
    if(x > 1) ans = ans - ans / x ;
    return ans ;
}

ll cal(ll a , ll b , ll m)
{
    if(m == 1) return 0 ;
    if(b == 0) return 1 ;
    ll p = get_phi(m);
    ll exp = cal(a , b - 1 , p);
    if(exp < p || exp)//这个判断条件，还不是很清楚为什么？
        return quickpow(a , exp , m);
    else
        return quickpow(a , exp+p , m);
}

int main()
{
    int t ;
    scanf("%d" , &t);
    while(t--)
    {
        ll a , b , m ;
        scanf("%lld%lld%lld" , &a , &b , &m);
        cout << cal(a , b , m)%m << endl;
    }


    return 0;
}