#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 7;
const int mod = 998244353;
//求解不定方程 ax+by=c 的最小整数解 x
ll exgcd(ll a, ll b, ll &x, ll &y)
{
    if (!b) {x = 1; y = 0; return a;}
    ll ans = exgcd(b, a % b, x, y);
    ll tmp = x;
    x = y;
    y = tmp - a / b * y;
    return ans;
}
ll x, y;
ll cal(ll a, ll b, ll c)
{
    x = 0,y = 0;
    ll ans = exgcd(a, b, x, y);
    if (c % ans)return -1;
    x *= c / ans; b /= ans;
    // y *= c / ans;
    if (b < 0)b = -b;
    x = (x % b + b) % b;
    return x;
}
void solve()
{
    int a,b;
    cin >> a >> b;
    int p = b,k = 1;
    while(p%2==0){
        p/=2;
        k*=2;
    }
    while(p%5==0){
        p/=5;
        k*=5;
    }
    ll c = cal(k,a,p);
    ll t = (p - 1ll * k * c) / a;
    int id = 2;
    while(t < 0){
        c = cal(k,a,p*id);
        t = (p *id - 1ll *k *c)/a;
    } 
    ll d = t *p;
    cout << c << " " <<d << '\n';
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--)
        solve();
    return 0;
}