进阶 Day 2
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
int qmi(int a, int b, int p)
{
LL res = 1;
while (b)
{
if(b & 1) res = (LL)res * a % p;
b >>= 1;
a = (LL)a * a % p;
}
return res;
} //qmi
int main(void)
{
int n;
scanf("%d", &n);
while (n--)
{
int a, b, p;
scanf("%d%d%d", &a, &b, &p);
printf("%d\n", qmi(a, b, p));
}
return 0;
}