#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>

using namespace std;

typedef long long LL;
typedef pair<LL, LL> PII;

LL read()
{
    LL x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9')
    {
        if(ch == '-') f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9')
    {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

void write(LL x)
{
    if(x < 0)
    {
        putchar('-');
        x = -x;
    }
    if(x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}

LL exgcd(LL a, LL b, LL &x, LL &y)
{
    if(!b)
    {
        x = 1, y = 0;
        return a;
    }
    LL d = exgcd(b, a % b, x, y);
    LL t = x;
    x = y;
    y = t - a / b * x;
    return d;
}

void solve()
{
    LL a = read(), b = read();
    LL x, y;
    LL t = 1;
    while(b % 2 == 0)
    {
        b /= 2;
        t *= 2;
    }
    while(b % 5 == 0)
    {
        b /= 5;
        t *= 5;
    }

    LL d = exgcd(t, b, x, y);
    LL u = b * t - a;
    LL v = b * t;
    for(LL i = 1;i * b <= 1e9; i *= 2)
    {
        for(LL j = 1;j * b <= 1e9; j *= 5)
        {
            LL l = x * (-a * j);
            l = (l % b + b) % b;

            if(l < u)
            {
                u = l;
                v = j * b;
            }
        }
    }
    write(u), putchar(' '), write(v), putchar('\n');
}

int main()
{
    LL T = read();
    while(T --)
    {
        solve();
    }
    return 0;
}