mod = 1000000007
eps = 10**-9


def main():
    import sys
    from math import gcd
    input = sys.stdin.readline

    def PrimeDecomposition(N):
        ret = {}
        n = int(N ** 0.5)
        for d in range(2, n + 1):
            while N % d == 0:
                if d not in ret:
                    ret[d] = 1
                else:
                    ret[d] += 1
                N //= d
            if N == 1:
                break
        if N != 1:
            ret[N] = 1
        return ret

    def euler_phi(N, P):
        P = PrimeDecomposition(N)
        ret = N
        for p in P:
            ret = ret * (p - 1) // p
        return ret

    T = int(input())
    for _ in range(T):
        N, C = map(int, input().split())
        P = PrimeDecomposition(N)
        div = []
        for d in range(1, N+1):
            if d * d > N:
                break
            if N%d == 0:
                div.append(d)
                div.append(N // d)
        if div[-1] ** 2 == N:
            div.pop()

        #ans = pow(C, 2*N, mod)
        ans = 0
        for d in div:
            x = pow(C ** 2, d, mod)
            ans = (ans + (x * euler_phi(N // d, P))%mod)%mod
        ans = (ans + (pow(C, N, mod) * N)%mod)%mod
        ans = (ans * pow(2*N, mod-2, mod))%mod
        print(ans)


if __name__ == '__main__':
    main()