#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

bool c[(1<<20)];
int n, pr[(1<<17)], p, d;
ll a, b, D[200];

int main(){
    ifstream cin ("pinex.in");
    ofstream cout ("pinex.out");
    cin >> n;
    for (int i=2; i<=1e6; i++){
        if (c[i]) continue;
        pr[++p] = i;
        for (int j=2*i; j<=1e6; j+=i) c[j] = 1;
    }
    for (int i=1; i<=n; i++, d = 0){
        cin >> a >> b;
        for (int i=1; pr[i] <= sqrt(b); i++){
            if (b % pr[i]) continue;
            D[++d] = pr[i];
            while (b % pr[i] == 0) b /= pr[i];
        }
        if (b > 1) D[++d] = b;
        ll rs = 0;
        for (int i=1; i<(1<<d); i++){
            ll prod = 1, k = 0;
            for (int j=0; j<d; j++)
                if ((1<<j) & i) prod *= D[j+1], k++;
            rs += (k & 1 ? 1 : -1)*a/prod;
        }
        cout << a-rs << '\n';
    }
    return 0;
}