Problem: You are given three integers a, b and c.

Find two positive integers x and y (x > 0, y > 0) such that: 

  * the decimal representation of x without leading zeroes consists of a digits; 
  * the decimal representation of y without leading zeroes consists of b digits; 
  * the decimal representation of gcd(x, y) without leading zeroes consists of c digits. 



gcd(x, y) denotes the [greatest common divisor (GCD)](https://en.wikipedia.org/wiki/Greatest_common_divisor) of integers x and y.

Output x and y. If there are multiple answers, output any of them.

Input

The first line contains a single integer t (1 ≤ t ≤ 285) — the number of testcases.

Each of the next t lines contains three integers a, b and c (1 ≤ a, b ≤ 9, 1 ≤ c ≤ min(a, b)) — the required lengths of the numbers.

It can be shown that the answer exists for all testcases under the given constraints.

Additional constraint on the input: all testcases are different.

Output

For each testcase print two positive integers — x and y (x > 0, y > 0) such that 

  * the decimal representation of x without leading zeroes consists of a digits; 
  * the decimal representation of y without leading zeroes consists of b digits; 
  * the decimal representation of gcd(x, y) without leading zeroes consists of c digits. 

Example

Input


4
2 3 1
2 2 2
6 6 2
1 1 1


Output


11 492
13 26
140133 160776
1 1

Note

In the example: 

  1. gcd(11, 492) = 1 
  2. gcd(13, 26) = 13 
  3. gcd(140133, 160776) = 21 
  4. gcd(1, 1) = 1 

Solution (in PYTHON3):

Solution:
import math
for k in range(int(input())):
    a,b,c=list(map(int,input().split()))
    if a==b==c:
        x=""
        for i in range(1,a+1):
            x+=str(i)
        y = int(x)
        print(x,x)
    elif a==b and c==1:
        x=""
        for i in range(1,a+1):
            x+=str(i)
        y=int(x)
        print(y,y+1)
    elif a==b and c!=1:
        x = ""
        for i in range(1, c+1):
            x += str(i)
        z=int(x)
        xx=""
        for i in range(1,a+1):
            xx+=str(i)
        y=int(xx) #123456
        ans=y//z #123456/12
        ans=ans*z #113168
        lol=ans/z
        lol=(lol+1)*z
        print(int(ans),int(lol))
    else:
        x = ""
        for i in range(1, c + 1):
            x += str(i)
        z = int(x)
        xx = ""
        for i in range(1, a + 1):
            xx += str(i)
        dekhi=""
        for i in range(1,b+1):
            dekhi+=str(i)
        g=int(dekhi)
        y = int(xx)
        while True:
            ans = y // z
            ans = y // z
            ans = ans * z  # 113168
            ans2 = g // z
            ans2 = ans2 * z
            d=len(str(math.gcd(ans,ans2)))
            if d==c:
                break
            z+=1

        print(int(ans), int(ans2))