You are given a series of test cases, each consisting of three positive integer values: A, B, and C, representing the number of digits in three positive integers, a, b, and c, respectively. Your task is to find the k-th smallest equality of the form a+b=c,where a has A digits,b has B digits, and c has C digits. All the numbers are positive integers and are written without leading zeroes.

An equality s is considered lexicographically smaller than another equality t if and only if the first position where s and t differ contains a smaller digit in s than in t.
Example:
Lets say we have “2+4=6” and “4+2=6”.
Start by comparing the first number of both expressions. In this case, 2 and 4.
Since 2 is smaller than 4, expression 1 (2 + 4 = 6) is lexicographically smaller than expression 2 (4 + 2 = 6).

Write a program to solve this problem for multiple test cases.

For each test case, if there are strictly less than k valid equalities, output −1.
Otherwise, output the k-th equality as a string of form a+b=c.
note- ouput as a" "+" "b" "=" "c.(spaces matter here)

Input:
7
1 1 1 9
2 2 3 1
2 2 1 1
1 5 6 42
1 6 6 10000000
5 5 6 3031568815
6 6 6 1000000000000

Output:
2 + 1 = 3
10 + 90 = 100
-1
9 + 99996 = 100005
-1
78506 + 28543 = 107049
-1

Explanation:
In the first test case, the first 9 solutions are: ⟨1,1,2⟩,⟨1,2,3⟩,⟨1,3,4⟩,⟨1,4,5⟩,⟨1,5,6⟩,⟨1,6,7⟩,⟨1,7,8⟩,⟨1,8,9⟩,⟨2,1,3⟩
so the ans is 2+1=3
In the third test case, there are no solutions as the smallest possible values for a
and b
are larger than the maximal possible value of c —10+10=20>9.
Please note that whitespaces in the output matter.