#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}


ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;

}


/*
using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
*/


vector<ll> fact, factinv, inv;
const ll mod = 1e9 + 7;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
        inv[i] = ((mod - ((inv[mod % i] * (mod / i))) % mod) + mod) % mod;
        factinv[i] = (factinv[i - 1] * inv[i]) % mod;
    }
}
ll nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k]) % mod)) % mod;
}


ll N,K;
ll score(vll &A){
    ll res=0;
    rep(i,N){
        res+=abs(A[i]-i);
    }
    return res;
}

ll D(ll x,vll &A){
    return abs(x-A[x]);
}

void pr(ll i,ll j,ll k,ll l,ll v){
    cout<<i+1<<" "<<j+1<<" "<<k+1<<" "<<l+1<<" "<<v<<endl;
    return;
}


bool DEBUG=0;

using ld=long double;
int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin>>N;
    rep(i,N){
        ld A,B;
        cin>>A>>B;
        ld M=B*log10(A);
        ll Z=floor(M);
        ld m=-1;
        ll d=-1;
        ld EPS=1e-19;
        rep(i,101){
            if(i<10)continue;
            m=ld(i)/10.0;
            m=log10(m);
            d=i-1;
            
            if(m+ld(Z)>M+EPS){
                if(i==10)Z--;
                break;
            }
        }
        cout<<d/10<<" "<<d%10<<" "<<Z<<endl;
    }

}