#include<bits/stdc++.h>
//Bipin.B
//Amrita School of Engineering
using namespace std;
long long int modular_exponentiation(long long int k,long long int n)
{
    long long int ans=k;
    k--;// Solution is k-1^n-1 multiplied with k. That is why i am reducing it
    n--;
    while(n!=0)
	{
        if(n%2==1)
		{
            ans=(ans*k)%1000000007;
            k=(k*k)%1000000007;
            n=n/2;
		}
		else if(n%2==0)
		{
            k=(k*k)%1000000007;
            n=n/2;
		}
	}
	return ans;
}
int main()
{
		long long int n,k;
        long long int parent,son;
		int t;
		cin>>t;
		while(t--)
		{
		cin>>n>>k;
		//for(int i=0;i<n-1;i++)
			//cin>>parent>>son;
		cout<<modular_exponentiation(k,n)<<endl;
		}
	return 0;
}