#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<29;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};


int main() {
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int a, b;
        cin >> a >> b;

        double l = ((double)b) * log10(a);
        
        double ll = l - ((int)l);

        int ansX, ansY;
        for (int X = 1; X <= 9; X++) {
            for (int Y = 0; Y <= 9; Y++) {
                for (int Z = 0; Z <= 9; Z++) {
                    double now = X + ((double)Y) / 10.0 + ((double)Z) / 100.0;
                    if (log10(now) >= ll) {
                        ansX = X;
                        ansY = Y;
                        
                        goto en;
                    }
                }

            }
        }
en:
        cout << ansX << " " << ansY << " " << ((int)l) << endl;
    }
    return 0;
}