Multiplication

Input

The input begins with an integer $t$ ( $1 \leq t \leq 10$ 1 \leq t \leq 10), representing the number of test cases. Each test case is described over two lines: the first line contains a non-negative integer $a_{i}$ a_i, and the second line contains another non-negative integer $b_{i}$ b_i. Both numbers are provided without leading zeros and can have up to $100000$ digits.

Output

For each test case, output the product of $a_{i}$ a_i and $b_{i}$ b_i as a single number. Ensure there are no leading zeros in the output, and separate the results for each test case with a newline.

Examples

Example 1

Loading