#include "testlib.h"
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint1000000007;
const int MAXT=10;
const int MAXN=1000000000;
const int MAXC=1000000000;
int main(int argc, char* argv[]){
    registerValidation(argc, argv);
    int t=inf.readInt(1, MAXT);
    inf.readEoln();
    while(t--){
        int n=inf.readInt(3, MAXN);
        inf.readSpace();
        int c=inf.readInt(1, MAXC);
        inf.readEoln();

        vector<int> vd;
        for(int i=1; i*i<=n; i++){
            if(n%i==0){
                vd.push_back(i);
                if(i*i<n) vd.push_back(n/i);
            }
        }
        sort(vd.begin(), vd.end());
        int m=vd.size();
        vector<int> vc(m);
        mint ans=mint(c).pow(n)*n;
        for(int i=m-1; i>=0; i--){
            vc[i]=n/vd[i];
            for(int j=i+1; j<m; j++){
                if(vd[j]%vd[i]==0) vc[i]-=vc[j];
            }
            ans+=mint(c).pow(2*vd[i])*vc[i];
        }
        ans/=(2*n);
        cout<<ans.val()<<endl;
    }
    inf.readEof();
    return 0;
}