from bisect import *
from math import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    logxy=[-1]*100
    for xy in range(10,100):
        logxy[xy]=log10(xy/10)
    n=II()
    for _ in range(n):
        a,b=MI()
        bloga=b*log10(a)
        integer=int(bloga)
        decimal=bloga-integer
        xy=bisect_left(logxy,decimal)
        if xy==100:xy=99
        if logxy[xy]-decimal>decimal-logxy[xy-1]:xy-=1
        x,y=divmod(xy,10)
        print(x,y,integer)

main()