#include <fstream>
#include <math.h>
#define ll long long
#define MAX_P 1000005
using namespace std;
ifstream fin("pinex.in");
ofstream fout("pinex.out");
bool ciur[MAX_P];
int prime[80000], t, curr, sol[80];
long long A, B, fact[80], Sol;
void read()
{
    fin>>A>>B;
}
void prec()
{
    prime[++prime[0]]=2;
    for(int i=3;i<MAX_P;i+=2)
    {
        if(ciur[i]==0)
        {
            prime[++prime[0]]=i;
            for(int j=i+i+i;j<MAX_P;j+= i << 1)
                ciur[j]=1;
        }
    }
}
void submultimi(int k, long long prod, int nr)
{
    if(sol[k-1]==fact[0])
        return;
    int ok=1;
    for(int i=sol[k-1]+1;i<=fact[0];i++)
    {
        sol[k]=i;
        if((nr+1)%2)
            ok=-1;
        Sol=Sol+1LL*ok*A/(1LL*prod*fact[i]);
        submultimi(k+1, 1LL*prod*fact[i], nr+1);
    }
}
void solve()
{
    fact[0]=curr=0;
    while(B>1)
    {
        curr++;
        if(B%prime[curr]==0)
        {
            fact[++fact[0]]=prime[curr];
            while(B%prime[curr]==0)
                B/=prime[curr];
        }
        if(B>1 && prime[curr]>sqrt(B))
        {
            fact[++fact[0]]=B;
            B=1;
        }
    }
    Sol=A;
    submultimi(1, 1, 0);
    fout<<Sol<<'\n';
}
int main()
{
    prec();
    fin>>t;
    while(t--)
    {
        read();
        solve();
    }
    return 0;
}