#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf (long long)1000000000000000000

void solve(){
	long long N,C;
	cin>>N>>C;
	
	vector<long long> y;
	for(long long i=1;i*i<=N;i++){
		if(N%i==0){
			y.push_back(i);
			if(i*i!=N)y.push_back(N/i);
		}
	}
	
	sort(y.rbegin(),y.rend());
	
	vector<long long> cnt(y.size());
	
	rep(i,y.size()){
		cnt[i] = N / y[i];
		rep(j,i){
			if(y[j] % y[i] == 0)cnt[i] -= cnt[j];
		}
	}
	
	mint ans = 0LL;
	ans += mint(C).pow(N);
	ans *= N;
	rep(i,cnt.size()){
		mint temp = mint(C).pow(y[i]*2);
		temp *= cnt[i];
		ans += temp;
	}
	ans /= N*2;
	
	cout<<ans.val()<<endl;
	
}

int main(){
	
	int _t;
	cin>>_t;
	
	rep(_,_t){
		solve();
	}
	
	return 0;
	
}