#include <iostream>
#include <algorithm>
#include <random>
#include <ctime>

typedef long long ll;
typedef double lf;
typedef __int128 LL;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int bs[12] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
inline ll Qpow(ll x, ll y, ll mod) {ll res = 1; while (y) (y & 1) && (res = (LL)res * x % mod), x = (LL)x * x % mod, y >>= 1; return res;}
inline bool Isprime(ll n)
{
    if (n < 3 || !(n & 1)) return n == 2;
    ll r = n - 1, d = 0;
    while (!(r & 1)) r >>= 1, d++;
    for (int i = 0; i < 12; i++)
    {
        if (n == bs[i]) return 1;
        ll s = Qpow(bs[i], r, n);
        if (s == 1) continue;
        for (int j = 0; j <= d; j++)
        {
            if (j == d) return 0;
            if (s == n - 1) break;
            s = (LL)s * s % n;
        }
    }
    return 1;
}
mt19937 Rand(time(0) ^ *(new unsigned long long));
ll res[80]; int tot;
inline ll PollardRho(ll n)
{
    ll c = Rand() % (n - 1) + 1, a = 0, b = c;
    auto f = [&](ll x) {return ((LL)x * x + c) % n;};
    int cnt = 0, lmt = 1; ll mul = 1, d;
    while (a != b)
    {
        mul = (LL)mul * (a - b + n) % n, cnt++;
        if (cnt == lmt)
        {
            if ((d = __gcd(mul, n)) > 1) return d;
            mul = 1, cnt = 0, lmt = min(127, lmt << 1);
        }
        a = f(a), b = f(f(b));
    }
    if ((d = __gcd(mul, n)) > 1) return d;
    return n;
}
void GetFactor(ll x)
{
    if (x == 1) return;
    if (Isprime(x)) return res[++tot] = x, void();
    ll d = PollardRho(x);
    while (d == x) d = PollardRho(x);
    GetFactor(d), GetFactor(x / d);
}

ll n, m, mod, ans;
ll pm[20];
int pc[20], cnt;

inline ll Qpow(ll x, ll y)
{
    x %= mod;
    ll res = 1;
    while (y) (y & 1) && (res = res * x % mod), x = x * x % mod, y >>= 1;
    return res;
}

void DFS(int u, ll cur, ll val)
{
    if (u > cnt)
    {
        if (!(cur & 1) || (n & 1))
            ans = (ans + (cur & 1 ? cur : cur >> 1) % mod * Qpow(m, (cur + 1) >> 1) % mod * (val % mod)) % mod;
        return;
    }
    ll mul = 1;
    for (int i = 0; i <= pc[u]; i++, mul *= pm[u])
        DFS(u + 1, cur * mul, (i != pc[u] ? val * (1 - pm[u]) : val));
}

inline void Solve()
{
    Read(n), Read(m), Read(mod);
    cnt = tot = 0;
    GetFactor(n);
    sort(res + 1, res + tot + 1);
    for (int i = 1; i <= tot; i++)
        if (i == 1 || res[i] != res[i - 1]) pm[++cnt] = res[i], pc[cnt] = 1;
        else pc[cnt]++;
    // for (int i = 1; i <= cnt; i++) cout << pm[i] << ' '; cout << '\n';
    // for (int i = 1; i <= cnt; i++) cout << pc[i] << ' '; cout << '\n';
    ans = 0, DFS(1, 1, 1);
    cout << (ans + mod) % mod << '\n';
}

int main()
{
    // freopen("C.in", "r", stdin);
    // freopen("C.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int T;
    Read(T);
    while (T--) Solve();
    return 0;
}