#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

double mlog10[101];

void solve(double &x, double &y, double &z) {
  double az;
  double t;
  t = modf(y*log10(x), &az);
  for (int i = 1; i < 100; i++) {
    if (mlog10[i] <= t && t < mlog10[i+1]) {
      x = i/10;
      y = i%10;
      break;
    }
  }
  z = az;
}

int main() {
  for (int i = 1; i <= 100; i++) {
    mlog10[i] = log10(double(i)/10.);
  }

  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    double a, b;
    scanf("%lf %lf", &a, &b);

    double x, y, z;
    x = a; y = b; z = 0;
    solve(x, y, z);
    printf("%.0lf %.0lf %.0lf\n", x, y, z);
  }

  // ll x, y, z;
  // scanf("%lld %lld %lld", &x, &y, &z);
  // convert(x, y, z);
  // printf("%lld %lld %lld\n", x, y, z);
}