#include <bits/stdc++.h>
using namespace std;
const int kMaxN = 101;
long long p[kMaxN];
int t, n;
long long x, y, g, ans;
long long Gcd(long long x, long long y) {
  if (!y) {
    return x;
  }
  return Gcd(y, x % y);
}
void Resolve(long long y) {
  n = 0;
  for (long long i = 2; i * i <= y; i++) {
    if (y % i == 0) {
      p[++n] = i;
      while (y % i == 0) {
        y /= i;
      }
    }
  }
  if (y > 1) {
    p[++n] = y;
  }
}
void Search(int i, long long s) {
  if (s >= x + y) {
    return;
  }
  if (i > n) {
    ans += (x + y - 1) / s - (x - 1) / s;
    return;
  }
  Search(i + 1, s);
  Search(i + 1, -s * p[i]);
}
int main() {
  cin >> t;
  while (t--) {
    cin >> x >> y;
    g = Gcd(x, y);
    x /= g;
    y /= g;
    Resolve(y);
    ans = 0;
    Search(1, 1);
    cout << ans << endl;
  }
  return 0;
}
