#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL fac[maxn];
bool vis[1<<22];
LL ksm(LL a,LL k){
   LL res=1;
   while(k){
     if(k&1) res=res*a%mod;
     k>>=1;
     a=a*a%mod;
   }return res%mod;
}
///map<LL,LL>map1;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   fac[0]=1;
   for(LL i=1;i<maxn;i++) fac[i]=fac[i-1]*i%mod;
   LL t;cin>>t;
   while(t--){
      ///map1.clear();
      LL n,k;cin>>n>>k;
      LL sum=1;
      for(LL i=1;i<=k;i++){
         sum=(sum%mod*n%mod)%mod;
      }
      cout<<sum<<"\n";
   }
   return 0;
}
