#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

  int n;
  cin >> n;
  rep(i,0,n) {
    ll a, b;
    cin >> a >> b;
    double x = log10(pow(a,b));
    int r = int(x);

    double tmp = pow(a,b) / pow(10,r);

    int ans1 = int(tmp);
    int ans2 = ((tmp-ans1)*10);
    cout << ans1 << " " << ans2 << " " << r << endl;

    // double sum = exp(b*log(a));
    // ll cnt = log10(exp(1));
    // ll ans1 = sum/(pow(10,cnt));
    // ll ans2 = (sum/(pow(10,cnt))-ans1)*10;
    // printf("%lld %lld %lld\n", ans1, ans2, cnt);
  }

	return 0;
}