#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>
#include <vector>

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

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e6 + 5;

ll M,A,B,nrPrimes,nrDivs;
int primes[NMax],divs[NMax];
bool notPrime[NMax];

int main() {

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

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

    /*
    for (int i=1;i <= 20;++i) {
        cout<<primes[i]<<' ';
    }
    cout<<"\n\n";
    //*/

    in>>M;
    while (M--) {
        in>>A>>B;
        nrDivs = 0;

        int 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;
        }

        /*
        for (int i=1; i<= nrDivs;++i) {
            cout<<divs[i]<<' ';
        }
        cout<<"\n\n";
        //*/

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

            ll card = A / prod;
            if (nr % 2 == 0) {
                card = -card;
            }
            noPrime += card;
        }

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



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