URD - Urdhva - Tiryag Bhyam


Given two large digit numbers find there product.

Input

1st line contain number of test cases T. Each of which followed by two numbers N1 and N2 (these are strings).

1<=T<=10^5,  1<=|N1|<=1000 & 1<=|N2|<=1000

Output

or each test case print product of these two numbers in separate line with no leading zero values.

Example

Input:
2
6 9
9 2
Output:
54
18

hide comments
wisfaq: 2017-06-15 12:20:22

Last edit: 2017-06-27 20:48:34
sas1905: 2017-06-14 17:40:22

Should be moved to tutorial..!!

Vipul Srivastava: 2017-06-14 17:21:09

I think few languages were banned after people made solutions in them

abis: 2017-06-14 17:13:38

Don't use BigInteger (java) or any other this type of things just try to make an algo.

abis: 2017-06-14 14:03:56

Sorry for wrong output file. plz resubmit your solution.

nikhilkala: 2017-06-14 09:44:02

submission id:19608934
Please check the solution..It follows all the constraints..
edit:
Do you mean trailing zeroes rather than leading?

Last edit: 2017-06-14 09:49:18

Added by:junior_g
Date:2017-06-14
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM32-GCC ASM64 BASH BC BF PYTHON PYPY PYTHON3 PY_NBC R SCALA SCM guile SCM qobi SED ST SWIFT VB.NET WHITESPACE