#include <bits/stdc++.h>
using namespace std;
vector<long long> prime_factors;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
int main(int argc, const char* argv[]) {
  int t;
  cin >> t;
  while (t--) {
    prime_factors.clear();
    long long a, m;
    cin >> a >> m;
    long long d = gcd(m, a);
    a /= d;
    m /= d;
    long long res = m;
    for (long long i = 2; i <= sqrt(m) && m != 1; ++i) {
      long long cnt = 0;
      while (m % i == 0) {
        ++cnt;
        m /= i;
      }
      if (cnt) prime_factors.push_back(i);
    }
    if (m != 1) prime_factors.push_back(m);
    for (int i = 0; i < prime_factors.size(); ++i) {
      res /= prime_factors[i];
      res *= prime_factors[i] - 1;
    }
    cout << res << endl;
  }
  return 0;
}
