You are given three integers a,b and c. Find two positive integers x and y (x>0 & y>0) such that: 1.the decimal representation of x without leading zeroes consists of "a" digits; 2.the decimal representation of y without leading zeroes consists of "b" digits; 3.the decimal representation of gcd(x,y) without leading zeroes consists of c digits. gcd(x,y) denotes the greatest common divisor (GCD) of integers x and y. Output x and y.
Input Format
The first line contains an integer T, number of test cases. The next t lines contain three integers a and b and c.
Output Format
For each test case print two positive integers x and y.
Constraints
1 <= t <= 200 1 <= a,b <= 9 1<= c <= min(a,b)
Example
Input
4 2 3 1 2 2 2 6 6 2 1 1 1
Output
16 243 10 10 163840 196830 1 1