#include <bits/stdc++.h>
using namespace std;
long long a, m, t;
long long fai(long long n) {
  long long sum = n;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) sum = sum / i * (i - 1);
    while (n % i == 0) n /= i;
  }
  if (n > 1) sum = sum / n * (n - 1);
  return sum;
}
long long gcd(long long x, long long y) {
  if (y == 0)
    return x;
  else
    return gcd(y, x % y);
}
int main() {
  cin >> t;
  while (t--) {
    cin >> a >> m;
    if (gcd(a, m) == 1)
      cout << fai(m) << endl;
    else
      cout << fai(m / gcd(a, m)) << endl;
  }
}
