# coding: utf-8
import collections, copy, heapq, itertools, math, sys

sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    A_B = [ILI() for __ in range(N)]
    return N, A_B


def solve(N, A_B):
    ans = []
    for A, B in A_B:
        num = A ** B
        s_num = str(num)
        len_num = len(s_num)
        if len_num == 1:
            X = 0
            Y = num
            Z = 1
        else:
            X = s_num[0]
            Y = s_num[1]
            Z = len_num - 1
        ans.append("{} {} {}".format(X, Y, Z))

    ans = "\n".join(map(str, ans))
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()