uva11582 Colossal Fibonacci Numbers!

#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn = 10000000 + 10;

typedef unsigned long long LL;
LL a,b,n,m;

int f[maxn];

LL power(LL k,LL e) {
    LL res=1;
    while(e) {
        if(e&1) res=res*k%m;
        k=k*k%m;
        e=e/2;    
    }
    return res;
}

int main() {
    int T;
    cin>>T;
    while(T--) {
        cin>>a>>b>>n;
        if(n==1) {
            cout<<0<<endl;
            continue;    
        }
        f[0]=0; f[1]=1;
        for(int i=2;;i++) {
            f[i]=(f[i-1]+f[i-2])%n;
            if(f[i]==f[1]&&f[i-1]==f[0]) {
                m=i-1;
                break;
            }
        }
        a%=m;
        cout<<f[power(a,b)]<<endl;
    }
    return 0;    
}