#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

template <class T>
void AddNr(T &a, T b) {
	a = a + b;
	while (a >= MOD1) {
		a -= MOD1;
	}
	while (a < 0) {
		a += MOD1;
	}
}

vector <int> primes(80000);
int pos;

void comp_primes() {
	int i, j, mmax = 1000001;
	vector <bool> notprime(mmax, 0);
	
	primes[pos++] = 2;
	for (i = 2; i < mmax; i += 2) {
		notprime[i] = 1;
	}
	for (i = 3; i < mmax; i += 2) {
		if (!notprime[i]) {
			primes[pos++] = i;
			for (long long j = (long long) i * i; j < mmax; j += i) {
				notprime[j] = 1;
			}
		}
	}
}

void solve() {
	vector <int> prime_fact;
	long long A, B, ans = 0;
	int i, mask;
	scanf("%lld %lld", &A, &B);
	
	for (auto x: primes) {
		if (B % x == 0) {
			prime_fact.push_back(x);
			while (B % x == 0) {
				B /= x;
			}
		}
		if (B > 1 && x > sqrt(B)) {
			prime_fact.push_back(B);
			break;
		}
		
		if (B == 1) {
			break;
		}
	}
	
	for (mask = (1 << prime_fact.size()) - 1; mask; --mask) {
		long long p = 1;
		int cnt = 0;
		for (i = 0; (1 << i) <= mask; ++i) {
			if (mask & (1 << i)) {
				++cnt;
				p *= prime_fact[i];
			}
		}
		if (cnt % 2) {
			ans += A / p;
		}
		else {
			ans -= A / p;
		}
	}
	
	cout << A - ans << '\n';
}


int main(){
	string fileInput = "pinex";
#ifdef INFOARENA
	freopen((fileInput + ".in").c_str(), "r", stdin);
	freopen((fileInput + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin);
#endif
#endif
	
	int t, i;
	
	comp_primes();
	scanf("%d", &t);
	while(t--) {
		solve();
	}
	return 0;
}