#include<iostream>
#include<vector>
#include<algorithm>
#include<atcoder/modint>
using namespace std;
using mint=atcoder::modint1000000007;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int T,N,C;
int cnt[10000];
main()
{
	cin>>T;
	for(;T--;)
	{
		cin>>N>>C;
		vector<int>d;
		for(int p=1;p*p<=N;p++)if(N%p==0)
		{
			d.push_back(p);
			if(p<N/p)d.push_back(N/p);
		}
		sort(d.begin(),d.end());
		mint ans=mint(C).pow(N)*N;
		for(int i=d.size();i--;)
		{
			cnt[i]=N/d[i];
			for(int j=i+1;j<d.size();j++)if(d[j]%d[i]==0)cnt[i]-=cnt[j];
			ans+=mint(C).pow(2*d[i])*cnt[i];
		}
		cout<<(ans/(2*N)).val()<<endl;
	}
}