#include<cstdio>
#include<math.h>
#define MAX 1000003

using namespace std;
int m,d,nd,i,j,k,n,p,x;
long long b,a,s,div[100100],primes[MAX];
char ciur[MAX];


void CreateCiur()
{
    long long i=2;
    primes[0]=0;
    while(i<MAX)
    {
        if(ciur[i]!=1)
        {
            primes[0]++;
            primes[primes[0]]=i;
            int j=i;
            for(j;j<MAX;j+=i)
            ciur[j]=1;
        }
        ++i;
    }
}

void divizori(long long n)
{
		for(int i=1;n>1;i++)
			if(n%primes[i]==0)
			{
				nd++;
				div[nd]=primes[i];
				while(n%primes[i]==0) n=n/primes[i];
			}
	if(n>1)
	{
		nd++;
		div[nd]=n;
	}
}
int main()
{
	freopen("pinex.in","r",stdin);
	freopen("pinex.out","w",stdout);
	CreateCiur();
	scanf("%d\n",&m);
	for(i=1;i<=m;i++)
	{
		scanf("%lld %lld\n",&a,&b);
		nd=0;s=a;d=floor(sqrt(b));
		divizori(b);
		for(j=1;j<1<<nd;j++)
		{
			p=1;x=j;n=0;
			for(k=1;k<=nd;k++)
			{
				if(x%2==1)
				{
					p=p*div[k];
					n++;
				}
				x=x/2;
			}
			if(n%2==1) s=s-a/p;
			else s=s+a/p;
		}
		printf("%lld\n",s);
	}
	fclose(stdin);fclose(stdout);
	return 0;
}