#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
using namespace std;
ifstream in("pinex.in");
ofstream out("pinex.out");
int divs[10001];
int solve(int a,int b)
{
    int n=0;
    for(int d=2;b!=1;d++)
    if(b%d==0)
    {
        divs[++n]=d;
        while(b%d==0)
            b/=d;
    }
    int sol=0;
    for(int i=1;i<=n;i++)
    {
        sol+=a/divs[i];
        for(int j=1;j<i;j++)
            sol-=a/(divs[i]*divs[j]);
    }
    return a-sol;
}
int main()
{
    int t;
    for(in>>t;t;t--)
    {
        int a,b;
        in>>a>>b;
        out<<solve(50,30)<<'\n';
    }
    return 0;
}