#include<bits/stdc++.h>
namespace {
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

using mint = modint1000000007;
std::vector<long long> divisors(long long x) {
    std::vector<long long> res1, res2;
    long long d = 1;
    for(; d * d < x; d++) {
        if (x % d == 0) {
            res1.push_back(d);
            res2.push_back(x / d);
        }
    }
    if (d * d == x) res1.push_back(d);
    int sz = res2.size();
    res1.reserve(res1.size() + sz);
    for(int i = sz - 1; i >= 0; i--) res1.push_back(res2[i]);
    return res1;
}

const mint inv2 = mint(2).inv();

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) {
    ll n, c;
    cin >> n >> c;
    auto ds = divisors(n);
    map<ll, mint> dp;
    for(int p: ds) {
      mint cnt = mint(c).pow(p);
      for(int x: ds) if (p % x == 0) {
        cnt -= dp[x];
      }
      dp[p] = cnt;
    }
    mint ans = 0;
    map<int, mint> invs;
    for(int d: ds) invs[d] = mint(d).inv();
    for(int p1: ds) for(int p2: ds) {
      if (p1 < p2) break;
      mint add;
      if (p1 == p2) {
        mint v = dp[p1];
        mint v2 = v / p1;
        add = v2 * p1 * ((v2 - 1) * inv2 + 1);
      } else {
        int g = gcd(p1, p2);
        add = dp[p1] * dp[p2] * invs[p1 / g * p2];
      }
      ans += add;
      // cout << p1 << ' ' << p2 << ' ' << add.val() << endl;
    }
    // for(int p: ds) cout << p << ' ' << (dp[p] / p).val() << endl;
    // for(int p: ds) {
      // ans += dp[p] / p;
    // }
    cout << ans.val() << '\n';
  }
}