#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("pinex.in");
ofstream out("pinex.out");
int64 divs[101],n,sol,a,b;
void gen(int64 x,int y,int k)
{
    if(k%2==1 && k!=0)
        sol+=a/x;
    else if(k!=0)
        sol-=a/x;
    for(int i=y+1;i<=n;i++)
    if(divs[i]*1LL*x <= a)
        gen(divs[i]*1LL*x,i,k+1);
}
vector<int> p;
int64 solve()
{
    n=0;
    for(int i=1;b!=1 && i<(int)p.size();i++)
    if(b%p[i]==0)
    {
        divs[++n]=p[i];
        while(b%p[i]==0)
            b/=p[i];
    }
    if(b>1)
        divs[++n]=b;
    sol=0;
    gen(1,0,0);
    return a-sol;
}
bool ciur[1000001];
int main()
{
    int t;
    p.pb(0);
    p.pb(2);
    for(int i=3;i<=1000000;i+=2)
    if(ciur[i]==false)
    {
        p.pb(i);
        for(int j=i+i;j<=1000000;j+=i)
            ciur[j]=true;
    }
    for(in>>t;t;t--)
    {
        in>>a>>b;
        out<<solve()<<'\n';
    }
    return 0;
}