总之,这个定理太强了
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
ll p;
struct matrix
{
ll a[2][2];
matrix(){memset(a,0,sizeof(a));}
};
matrix tmp,tmp2;
matrix multi(matrix m2,matrix m1)
{
matrix ans;
for(int i=0;i<2;i++)
for(int j=0;j<2;j++)
for(int k=0;k<2;k++)
ans.a[i][j]=(ans.a[i][j]+m1.a[i][k]*m2.a[k][j]%p)%p;
return ans;
}
ll qpow(ll n)
{
while(n)
{
if(n%2)
tmp2=multi(tmp2,tmp);
tmp=multi(tmp,tmp);
n>>=1;
}
return tmp2.a[1][0]%p;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ll n,m;
scanf("%lld%lld%lld",&n,&m,&p);
tmp.a[0][0]=tmp.a[0][1]=tmp.a[1][0]=1;
tmp.a[1][1]=0;
tmp2.a[0][0]=1;
tmp2.a[0][1]=tmp2.a[1][1]=tmp2.a[1][0]=0;
ll ans=__gcd(n+2,m+2)%p;
ll ansn=qpow(ans);
printf("%lld\n",ansn);
}
return 0;
}