#include <iostream>
#include <fstream>
#include <unordered_map>
#include <cmath>

#define ll long long
using namespace std;
ifstream in("pinex.in");
ofstream out("pinex.out");

const int NMax = 1e6 + 5;

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

int main() {

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

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

    in>>M;
    while (M--) {
        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;
        }

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

        ll notPrime = 0;
        ll lim = 1<<nrDivs;
        for (ll i=1;i < lim;++i) {

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

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

            notPrime += nr;
        }

        out<<A-notPrime<<'\n';
    }

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