#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define inf (1<<30)
#define base 256
#define ba 255
#define N 1010
#define EPS 1e-12
#define mod  666013
#define inu "pinex.in"
#define outu "pinex.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int n,a,b,u,p[N],S[N],sol,x,t,bit,lim,e[300100],et,y;
bitset<1000100> viz;
int main ()
{
    for(int i=2;i<=1000000;++i)
    if(!viz[i])
    {
        e[++et]=i;
        for(int j=i+i;j<=1000000;j+=i)
        viz[j]=1;
    }
    f>>n;
    FOR(i,1,n)
    {
        f>>a>>b;
        u=0;
        for(int j=1;e[j]*e[j]<=b&&j<=et;++j)
        if(b%e[j]==0)
        {
            S[++u]=e[j];
            while(b%e[j]==0)
            b/=e[j];
        }
        if(b!=1)
        S[++u]=b;
        lim=(1<<u);
        sol=0;
        for(int j=1;j<lim;++j)
        {
            x=1;
            t=1;
            y=j;
            bit=0;
            while(y)
            {
                if(y&1)
                {
                    x=x*S[t];
                    bit++;
                }
                t++;
                y>>=1;
            }
            if(bit&1)
            sol+=a/x;
            else
            sol-=a/x;
        }
        g<<a-sol<<"\n";
    }
    return 0;
}