UVA 11582(p316)----Colossal Fibonacci Numbers!

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1000+50;
typedef unsigned long long ULL;
ULL a,b,n;
ULL flag[maxn],f[maxn][maxn*10];
ULL  Mi(ULL a,ULL b,ULL n)
{
    ULL t=1,y=a;
    while(b)
    {
        if(b&1==1) t=t*y%n;
        y=y*y%n;
        b=b>>1;
    }
    return t;
}
void prepare()
{
    for(int n=2; n<=1000; n++)
    {
        f[n][0]=0;
        f[n][1]=1;
        for(int i=2;; i++)
        {
            f[n][i]=(f[n][i-1]+f[n][i-2])%n;
            if(f[n][i-1]==0&&f[n][i]==1)
            {
                flag[n]=i-1;
                break;
            }
        }
    }
}
void solve()
{
    if(a==0||n==1) printf("0\n");
    else
    {
        //cout<<a<<" "<<b<<" "<<flag[n]<<endl;
        ULL tmp=Mi(a%flag[n],b,flag[n]);
        cout<<f[n][tmp]<<endl;
    }
}
int main()
{
    int t;
    prepare();
    scanf("%d",&t);
    while(t--)
    {
        cin>>a>>b>>n;
        solve();
    }
    return 0;
}