#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e1 + 4;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  cin >> t;
  int cas = 0;
  while (t--) {
    ll n, m, i, j, cnt = 0, cnt1 = 0, cnt2 = 0, even = 0, odd = 0, len, k, r, l,
                   z = 0, x = 0, y = 0, flag = 0, sum = 0;
    ll a = 0, b = 0, c = 0, d = 0, ans = 0, rem, quot, zero = 0, fst = 0,
       null = 0, snd = 0, lst = 0, rone = 0, one = 0, pos = 0, neg = 0,
       mn = INT_MAX, mx = INT_MIN;
    char ch;
    int h1, h2, m1, m2, h;
    int velo1, velo2, ac1, ac2, tim, hour, mint, sec;
    int node, edge, u, v, cost;
    int bst, wrst;
    double nd, ad, bd, xd, sumd = 0.00;
    string str, str1 = "", str2 = "", str3 = "", strstore1 = "", strstore2 = "";
    cin >> n >> m;
    vector<ll> vec;
    k = sqrt(m);
    x = m;
    if (n % m || n < m) {
      cout << n << endl;
      continue;
    }
    for (i = 2; i <= sqrt(x); i++) {
      if (x % i == 0) {
        vec.push_back(i);
      }
      while (x % i == 0) {
        x /= i;
      }
    }
    if (x > 1) {
      vec.push_back(x);
    }
    sort(vec.begin(), vec.end());
    x = 1;
    for (i = 0; i < vec.size(); i++) {
      y = n;
      while (y % m == 0) {
        y /= vec[i];
      }
      x = max(x, y);
    }
    cout << x << endl;
  }
  return 0;
}
