fastpower

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int ans,n=1012,k;
int fastpower(int x,int y){//x^y%n
    ans=1;
    k=x%n;
    while(y){
        if(y%2)//y是奇数
            ans=(ans*k)%n;
        k=(k*k)%n;
        y=y/2;
    }
    return ans;
}
int main(){
    int a,b,c;
    cin>>a;
    for(int i=0;i<a;i++){
        scanf("%d%d",&b,&c);
        printf("%d
",fastpower(b,c));
    }
    return 0;
}