M. Recover the Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Majed is working on an old digital calculator. Unfortunately, some of its displays are damaged, and each displayed number contains exactly one corrupted character instead of a digit.

The calculator shows two strings $$$x$$$ and $$$y$$$, each of length exactly $$$3$$$. Every string contains exactly two decimal digits ('0' to '9') and one non-digit character. The corrupted character may appear in any position.

To recover the original numbers, Majed removes the corrupted character from each string. The remaining digits keep their relative order and form a two-digit integer. It is guaranteed that the resulting integers do not contain leading zeros.

Help Majed determine the product of the two recovered integers.

Input

The first line contains a single integer $$$T$$$ ($$$1 \le T \le 10^5$$$), the number of test cases.

Then $$$T$$$ test cases follow.

Each test case consists of a single line containing two strings $$$x$$$ and $$$y$$$ separated by a space.

Each of $$$x$$$ and $$$y$$$ has length exactly $$$3$$$, contains exactly two decimal digits and one non-digit character.

After removing the non-digit character from a string, the remaining digits form a two-digit integer. It is guaranteed that these integers do not contain leading zeros.

Output

For each test case, print a single integer on a separate line: the product of the integers obtained after removing the non-digit character from $$$x$$$ and $$$y$$$.

Example
Input
3
44$ !19
4#4 19!
%44 1!9
Output
836
836
836
Note

In the first test case, the string 44$ becomes 44 after removing the non-digit character $, and the string !19 becomes 19 after removing !.

Therefore, the answer is $$$44 \times 19 = 836$$$.