#include <iostream>
#include <fstream>
#include <cstdlib>
#include <vector>
#include <stack>
#include <time.h>
#include <cstdlib>
#include <algorithm>

using namespace std;
ifstream in("pinex.in");
ofstream out("pinex.out");

#define ll long long
#define ull unsigned long long
#define pb push_back
const ll inf = 1e18 + 5;
const int NMax = 5e5 + 5;
const int valMax = 1e6 + 5;

int M,nrPrimes,nrDivs;
bool notPrime[valMax];
int primes[valMax],divs[valMax];

int main() {

    primes[++nrPrimes] = 2;
    for (int i=3;i <= valMax;i += 2) {
        if (notPrime[i]) {
            continue;
        }

        primes[++nrPrimes] = i;
        for (int j=3*i;j <= valMax;j += 2*i) {
            notPrime[j] = true;
        }
    }

    in>>M;
    while (M--) {
        ll A,B;
        in>>A>>B;

        nrDivs = 0;
        ll p;
        for (int i=1;(p = primes[i]) != 0 && p*p <= B;++i) {
            if (B % p != 0) {
                continue;
            }

            while (B % p == 0) {
                B /= p;
            }

            divs[++nrDivs] = p;
        }
        if (B != 1) {
            divs[++nrDivs] = B;
        }

        ll notCoprime = 0,lim = 1<<nrDivs;
        for (ll u=1;u < lim;++u) {
            ll prod = 1, nr = 0;
            for (int j=1;j <= nrDivs;++j) {
                if ((1<<(j-1)) & u) {
                    prod *= divs[j];
                    ++nr;
                }
            }

            ll card = A / prod;

            nr %= 2;
            if (!nr) {
                card = -card;
            }

            notCoprime += card;
        }

        ll ans = A - notCoprime;
        out<<ans<<'\n';
    }

    in.close();out.close();
    return 0;
}