/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define N 1000100
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("pinex.in");
ofstream g("pinex.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
long long sol,a;
int b,viz[N],m,t,ts,st[300],E[N/10];
int main ()
{
    FOR(i,2,1000000)
    if(!viz[i])
    {
        E[++t]=i;
        for(int j=i+i;j<=1000000;j+=i)
            viz[j]=1;
    }
    f>>m;
    while(m--)
    {
        f>>a>>b;
        sol=0;
        ts=0;
        FOR(i,1,t)
        {
            if(1LL*E[i]*E[i]>b)
                break;
            if(b%E[i]==0)
            {
                st[++ts]=E[i];
                while(b%E[i]==0)
                    b/=E[i];
            }
        }
        if(b!=1)
            st[++ts]=b;
        int li=(1<<ts);
        li--;
        FOR(i,0,li)
        {
            int x=i;
            int p=1;
            int nrb=0;
            ll r=1;
            while(x)
            {
                if(x&1)
                {
                    nrb++;
                    r=r*st[p];
                }
                x>>=1;
                p++;
            }
            if(nrb&1)
                sol-=a/r;
            else
                sol+=a/r;
        }
        g<<sol<<"\n";
    }
    return 0;
}