#include<cstdio>
#include<iostream>
#include<bitset>
using namespace std;
bitset <1000005> q;
int n,nr,num,v[32];
long long a,b,s,p,t,w[80005];
void ciur()
{
    int i,j;
    q[1]=1;
    for (i=1;i<1000005;++i)
        if (!q[i])
        {
            w[++num]=i;
            for (j=2;i*j<1000005;++j)
                q[i*j]=1;
        }
}
void back(int k)
{
    int i;
    for (i=0;i<2;++i)
    {
        s+=i;
        if (i) p*=v[k];
        if (k==nr)
        {
            if (s%2) t-=a/p;
            else t+=a/p;
        }
        else if (k<nr) back(k+1);
        s-=i;
        if (i) p/=v[k];
    }
}
int main()
{
    int i;
    long long j;
    freopen("pinex.in","r",stdin);
    freopen("pinex.out","w",stdout);
    scanf("%d",&n);
    ciur();
    for (i=0;i<n;++i)
    {
        cin>>a>>b;
        for (j=1,nr=0;w[j]*w[j]<=b;++j)
        {
            if (b%w[j]==0) v[++nr]=w[j];
            while (b%w[j]==0) b/=w[j];
        }
        if (b!=1) v[++nr]=b;
        p=1, s=0, t=0;
        if (nr) back(1);
        else t=a;
        cout<<t<<'\n';
    }
    return 0;
}