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:
from math import gcd as g
t = int(input())
for i in range(t):
    a, b, c = list(map(int, input().split()))
    am = 10 ** a - 1
    bm = 10 ** b - 1
    cm = 10 ** c - 1
    ax = 10 ** (a - 1)
    bx = 10 ** (b - 1)
    cx = 10 ** (c - 1)

    m = 0
    if a == b and b == c: print(am, bm)
    elif c == 1:
        if a > b: print(bm*(10 ** (a - b)) + 1, bm)
        elif b > a: print(am, am * (10 ** (b -a)) + 1)
        else: print (am, am - 1)
    else: 
        if a > b: 
            if b != c: print(ax, bx + cx)
            else: print(ax, bx)
        else: 
            if a != c: print(ax + cx, bx)
            else: print(ax, bx)