#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");
int divs[10001],n;
int64 sol;
void gen(int64 x,int y,int k,int a)
{
    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,a);

}
int solve(int a,int b)
{
    n=0;
    for(int d=2;b!=1;d++)
    if(b%d==0)
    {
        divs[++n]=d;
        while(b%d==0)
            b/=d;
    }
    sol=0;
    gen(1,0,0,a);
    return a-sol;
}
int main()
{
    int t;
    for(in>>t;t;t--)
    {
        int a,b;
        in>>a>>b;
        out<<solve(a,b)<<'\n';
    }
    return 0;
}