#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;
  
const string file = "pinex";
  
const string infile = file + ".in";
const string outfile = file + ".out";

const int MAXPRIME = 1000001;
typedef long long int64;

vector<int> primes;

void ciur()
{
	bitset<MAXPRIME> marked;

	for(int i = 2; i < MAXPRIME; i+= 2)
	{
		marked[i] = true;
	}
	primes.push_back(2);
	for(int i = 3; i < MAXPRIME; i += 2)
	{
		if(marked[i] == false)
		{
			primes.push_back(i);
			if(i >= sqrt(MAXPRIME)) continue;
			for(int j = i*i; j < MAXPRIME; j += 2*i)
			{
				marked[j] = true;
			}
		}
	}


}

int64 query(int64 A, int64 B)
{
	int sqr = ((int) sqrt(B)) + 1;
	vector<int> diviz;
	for(vector<int>::iterator itr = primes.begin();
		itr != primes.end();
		itr++)
	{
		if(B % *itr == 0)
		{
			diviz.push_back(*itr);
			while(B % *itr == 0)
			{
				B /= *itr;
			}
		}
		if(*itr >= sqr) break;
	}
	if( B > 1)
	{
		diviz.push_back((int)B);
		B = 1;
	}

	int size = diviz.size();
	
	int64 answer = A;

	for(int i = 1; i < (1 << size); i++)
	{
		int64 produs = 1;
		bool negative = true;
		for(int j = 0; j < size; j ++)
		{
			if( i & (1 << j))
			{
				negative ^= 1;
				produs *= diviz[j];
			}
		}
		answer -= (negative == true ? -1LL : 1LL) * A/produs;
	}

	return answer;
}


int main()
{
	ciur();

	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);

	int M;
	fin >> M;
	for(int i = 0; i < M; i++)
	{
		int64 A;
		int64 B;
		fin >> A >> B;


		fout << query(A, B) << "\n";

	}




	fout.close();
	fin.close();
}