快速幂

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <limits.h>
#include <queue>
#define inf 0x3f3f3f3f
#define MAXM 200005
#define MOD 99991
using namespace std;
const double pi=3.141592653589793239,e=2.7182818284590452354;

long long ans,a,b;

void power(long long b)
{
	if(b==0)
	{
		ans=1;
		return;
	}
	if(b==1)
	{
		ans=a%MOD;
		return;
	}
	power(b>>1);
	ans=((ans%MOD)*(ans%MOD))%MOD;
	if(b&1)
	{
		ans=((ans%MOD)*(a%MOD))%MOD;
		return;
	}
	return;
}

int main(int argc, char** argv) {
	int t;
	cin>>t;
	while(t--){
		cin>>a>>b;
		power(b);
		cout<<ans<<endl;
	}
	return 0;
}