#include<iostream>
using namespace std;
long long m=10000000007;
long long powMod(long long n, long long k)
{
    if(k == 1) {
        return (n);
    } else {
    	n=n%m;
        long long temp = powMod(n, k/2) %m;
        if(k % 2 == 0)
            return ((temp) * (temp) % m);
        else
            return ((((temp) * (temp)) % m)* n % m);
    }
}
int main(){
long long n,k;
long long t;
	cin>> t;
	while(t--){

	cin >>n;
	cin >>k;
	cout << powMod(n,k) << endl;


}
}