#include <fstream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin ("pinex.in");
ofstream fout("pinex.out");
long long t,F[1000002],sol,k,P,A,B;
long long v[20],D[20];
vector <long long> prime;
void precalc()
{
    F[0]=2;
    F[1]=2;
    for(int i=2;i<=1000000;i++)
    {
        if(!F[i])
        {
            F[i]=1;
            prime.push_back(i);
            for(int j=i+i;j<=1000000;j+=i)
                F[j]=2;
        }
    }
}
void backtrack(int pas,int ant)
{
    if(pas<=k)
    {
        for(int i=ant+1;i<=k;i++)
        {
            v[pas]=D[i];
            P*=D[i];
            backtrack(pas+1,i);
            if(pas%2)
                sol+=A/P;
            else
                sol-=A/P;
            P/=D[i];
        }
    }
}
void solve()
{
    fin>>A>>B;
    int ind=0;
    k=0;
    while(B!=1&&ind<prime.size())
    {
        if(B%prime[ind]==0)
        {
            D[++k]=prime[ind];
            while(B%prime[ind]==0)
                B/=prime[ind];
        }
        ind++;
    }
    P=1;
    sol=0;
    backtrack(1,0);
    fout<<A-sol<<"\n";
}
int main()
{
    precalc();
    fin>>t;
    while(t--)
        solve();
    return 0;
}