#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include<ctime>
using namespace std;
const int maxn = 1e6 + 1000;
typedef long long ll;
ll F[maxn], phi[maxn], inv[maxn];
ll  N, M, P;
void init(int n) {
    for (int i = 1; i <= n; ++i) phi[i] = i;
    for (int i = 2; i <= n; ++i) {
        if (i == phi[i]) {
            for (int j = i; j <= n; j += i) phi[j] = phi[j] / i * (i - 1);
        }
    }
}
void init2(void) {
    inv[1] = 1;
    for (int i = 2; i <= N; ++i)
        inv[i] = (P - P / i * inv[P%i] % P) % P;
    for (int i = N; i; --i) {
        F[i] = 1ll * (N / i)*(M / i);
        // if(i == 1) cout<<F[i]<<endl;
        for (int j = i + i; j <= N; j += i)
            F[i] -= F    [j];
    }
}
int main() {
    int t; cin >> t;
    init(maxn-1);
    while (t--) {    
        cin >>N>>M>>P;
        if (N < M)swap(N, M);
        init2();
        ll ans = 0;
        for (ll i = 1; i <= N; ++i) {
            ans += (ll)i*inv[phi[i]] % P*(F[i] % P) % P;
            ans %= P;
        }
        cout << ans%P << endl;
    }
}
/*

*/